FCM-FCS: Hybridization of Fractional Cuckoo Search with FCM for High Dimensional Data Clustering Process


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


Dimensionality reduction is essential in multidimensional data mining since the dimensionality of real time data could easily reach higher dimensions. Most recent efforts on dimensionality reduction, however, are not adequate to multidimensional data due to lack of scalability. In this paper, we improve the performance of the fractional cuckoo search algorithm by utilizing the FCM function as objective function and we utilize the FCM operator which helps to improve the fitness value of worse solution. The fractional cuckoo search (FCS) algorithm is modified  to reduce the dimension and select the best dimension. Once the high dimensional data is reduced in to low dimensional data, then the data is supplied to the clustering algorithm to make the partition easily. Finally, the experimentation is made with synthetic and real datasets and  has been we have proved that efficiency of the FCM-FCS algorithm is 1.21% better than FPSO algorithm on iris dataset. The proposed algorithm is 0.66% better than FPSO 4.91% better than FCS on wine dataset and 3.4% better than FPSO 0.1% better than FCS on synthetic dataset.
Copyright © Praise Worthy Prize - All rights reserved.

Keywords


Cuckoo Search Algorithm; Levy Flights; Dimension Reduction; High Dimensional Database; Fractional Cuckoo Search; Fuzzy Operator; Fuzzy Objective Function

Full Text:

PDF


References


R. Agrawal, J. Gehrke, D. Gunopulos and P. Raghavan, “Automatic Subspace Clustering of High Dimensional Data,” Data Mining and Knowledge Discovery, vol. 11, no. 1, pp. 5–33, 2005.

A. K. Jain, M. N. Mutry, and P.J. Flynn, “Data Clustering: A Review,” ACM Computing Surveys, vol. 31, no. 3, pp. 264–323, 1999.

Mohamed Bouguessa and Shergrui Wang, “Mining Projected Clusters in High-Dimensional Spaces”, IEEE transaction on knowledge and data engineering, vol. 21, no. 4, pp. 507-522, 2009.

J. C. Bezdek,Pattern Recognition with Fuzzy Objective Function Algorithms. New York: Plenum, 1981

Mukhopadhyay, A. , Maulik, U., Bandyopadhyay, S., “Multiobjective Genetic Algorithm-Based Fuzzy Clustering of Categorical Attributes”, IEEE transactions on evolutionary computation, vol. 13, no. 5, pp. 991-1005, 2009.

Yongmao Wang , Yukun Wang, “Semi-Supervised Dimensionality Reduction”, Proceedings of the Third International Symposium on Computer Science and Computational Technology, pp. 506-509, August 2010.

H. Liu and L. Yu, “Toward Integrating Feature Selection Algorithms for Classification and Clustering,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 3, pp. 1–12, 2005

C.C. Aggarwal, C. Procopiuc, J. L. Wolf, P.S. Yu, and J.S. Park, “Fast Algorithm for Projected Clustering,” Proc. ACM SIGMOD Conf., pp. 61–72, 1999.

L.O. Jimenez and D.A. Landgrebe. Supervised classification in high-dimensional space: geometrical, statistical, and asymptotical properties of multivariate data. IEEE Transactions on Systems, Man and Cybernetics, 28(1):39–54, 1997.

L.J.P. van der Maaten, E.O. Postma and H.J. van den Herik, “Dimensionality Reduction: A Comparative Review” Technical Report TiCC TR, 2009.

D. Cai, X. He, and J. Han, “Document clustering using locality pre-serving indexing,” IEEE Trans. Knowl. Data Eng., vol. 17, no. 12, pp. 1624–1637, Dec. 2005.

S. Deerwester, T. Dumais, W. Furnas, K. Landauer, and R. Harshman, “Indexing by latent semantic analysis,”Journal of the American Society for Information Science, vol. 41, no. 6, pp. 319–407, Sep. 1990.

Y. Yang and J. Pederson, “A comparative study on feature selection in text categorization,” in Proc. the 14th Int’l Conf. on Machine Learning, Nashville, Tennessee, Jul. 1997, pp. 412–420.

Min Soo Kim , Kyu-Young Whang, Yang-Sae Moon, “Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases”, IEEE 28th International Conference on Data Engineering, 2012.

Todd Wittman, Kate Burgers, Yohannes Fessehatsion, Sheida Rahmani and Jia Yin Seo, “A Comparative Analysis of Dimension Reduction Algorithms on Hyperspectral Data” 2009.

Serkan Kiranyaz, Turker Ince, Alper Yildirim, and Moncef Gabbouj, “Fractional Particle Swarm Optimization in Multidimensional Search Space”, IEEE Transactions on Systems, Man, and Cybernetics, VOL. 40, NO. 2, pp. 298-319, 2010.

X.-S. Yang, S. Deb, “Cuckoo search via L´evy flights”, in: Proc. Of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), December 2009, India. IEEE Publications, USA, pp. 210-214 (2009).

Xiaohui Cui , Beaver, J.M. ; St. Charles, J. ; Potok, T.E. , “Dimensionality reduction particle swarm algorithm for high dimensional clustering ”, Swarm Intelligence Symposium, pp:1-6, 2008.

Fuhua Yu, "An Improved Automatic FCM Clustering Algorithm", 2010 2nd International Workshop on Database Technology and Applications (DBTA), pp. 1 - 4 , 2010.

Kerstin Bunte, Petra Schneider, Barbara Hammer, Frank-Michael Schleif, Thomas Villmann and Michael Biehl, “Limited Rank Matrix Learning, discriminative dimension reduction and visualization”, Neural Networks, Vol. 26, pp. 159–173, 2012.

M. G. B. Blum, M. A. Nunes, D. Prangle and S. A. Sisson, “A Comparative Review of Dimension Reduction Methods in Approximate Bayesian Computation”, Statistical Science, Vol. 28, No. 2, 189–208, 2013.

D.Napoleon and S.Pavalakodi, “A New Method for Dimensionality Reduction using KMeans Clustering Algorithm for High Dimensional Data Set”, International Journal of Computer Applications, Vol. 13, No.7, pp. 41-46, January 2011.

Suresh Chandra Satapathy and Anima Naik “Efficient Clustering of Dataset Based On Particle Swarm Optimization”, International Journal of Computer Science Engineering and Information Technology Research, Vol.3, No. 1, pp. 39-48, Mar 2013.

Imola fodor, "A Survey of Dimension Reduction Techniques", 2002

B. R. Rajakumar, "The Lion's Algorithm: A New Nature Inspired Search Algorithm", Procedia Technology, Vol. 6C, pages: 126-135, 2012.

http://archive.ics.uci.edu/ml/datasets.html

Yilmaz, G., Badur, B.Y., Mardikyan, S., Development of a constraint based sequential pattern mining tool, (2011) International Review on Computers and Software (IRECOS), 6 (2), pp. 191-198.

Daylan, A., Badur, B.Y., Darcan, O.N., An experimental study for extending data mining standards, (2011) International Review on Computers and Software (IRECOS), 6 (3), pp. 336-346.

Moravej, Z., Akhlaghi, A., A new approach for DG allocation in distribution network with time variable loads using cuckoo search, (2012) International Review of Electrical Engineering (IREE), 7 (2), pp. 4027-4034.

Thomas, J., Kulanthaivel, G., Preterm birth prediction using cuckoo search-based fuzzy min-max neural network, (2013) International Review on Computers and Software (IRECOS), 8 (8), pp. 1854-1862.


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize