Information Technology Journal1812-56381812-5646Asian Network for Scientific Information10.3923/itj.2012.1409.1417VijendraSingh AshiwiniK. LaxmanSahoo 1020121110This paper proposed an evolutionary clustering algorithm which
can automatically determine the number of clusters present in a data set. The
chromosomes are represented as strings of real numbers, encode the centers of
a fixed number of clusters. The searching capability of evolutionary clustering
is exploited in order to search for appropriate cluster centers in the feature
space such that a similarity metric of the resulting clusters is optimized.
The proposed clustering approach called Fast Automatic Clustering Evolution
(FACE) in data set. To obtain a speedup over linear search in high dimensional
data a randomized k-d trees based nearest neighbor search is used. The
chromosomes are able to exchange their gene values according to nearest cluster
centers and relation among genes in crossover operator. Mutation operator replaced
the mutation gene value with respect to nearest neighbor cluster. Adaptive probabilities
of crossover and mutation are employed to prevent the convergence of the GA
(Genetic Algorithm) to a local optimum. The Adjusted-Rand Index is used as a
measure of the validity of the clusters. Effectiveness of the proposed algorithm
is demonstrated for both artificial and real-life data sets. The experimental
result demonstrates that the proposed clustering algorithm (FACE) has high performance,
effectiveness and flexibility. The proposed evolutionary algorithm is able for
clustering low to high dimensional data set.]]>Han, J. and M. Kamber,2004Everitt, B., S. Landau and M. Leese,2001McLachlan, G. and T. Krishnan,1997Yousria, N.A., M.S. Kamel and M.A. Ismail,20094211931209Singh, V., L. Sahoo and A. Kelkar,20103118122Vijendra, S., L. Sahoo and K. Ashwini,20102010pp: 250253Singh, V., L. Sahoo and A. Kelkar,20113171177Goldberg, D.E.,1989Liu, G.L.,19681st Edn.,Murthy, C.A. and N. Chowdhury,199617825832Sun, J.G., J. Liu and L.Y. Zhao,2008194861Lin, H.J., F.W. Yang and Y.T. Kao,20058113122Srinivas, M. and L.M. Patnaik,199424656667Ioannis, A., A. Sarafis, P.W. Trinder and A.M.S. Zalzala,20057668710Friedman, J.H. and J.J. Meulman,200466815849Silpa-Anan, C. and R. Hartley,20082008pp: 18Freidman, J.H., J.L. Bentley and R.A. Finkel,19773209226Rand, W.M.,197166846850Hubert, L. and P. Arabie,19852193198Nguyen, C.D. and K.J. Cios,200817842054227Chu, Y.H., Y.J. Chen, D.H. Yang and M.S. Chen,20092114321446Vijendra, S.,20111010921105Arora, A., S. Upadhyaya and R. Jain,20098173180Garg, S. and R.C. Jain,2006511321135Ranjan, J. and S. Khalil,2007612171223Velmurugan, T. and T. Santhanam,201110478484Zhou, H., B. Feng, L. Lv and Y. Hui,2007.]]>6255258Hemalatha, M. and K. Vivekanandan,20081444450Ouadfel, S. and M. Batouche,20076196201Gautam, G. and B.B. Chaudhuri,200425173187Bandyopadhyay, S. and U. Maulik,2002146221237Mitra, S.,20042514391449Karypis, G., E.H. Han and V.K.P. Kumar, 1999326875Wang, W., J. Yang and R. Muntz,19971997pp: 186195Zarandi, M.H.F. and A. Alaeddini,201018030333044Chu, Y.H., J.W. Huang, K.T. Chuang, D.N. Yang and M.S. Chen,2010221630Deng, Z., K.S. Choi, F.L. Chung and S. Wang,201043767781Jain, A.K., M.N. Murty and P.J. Flynn,199931264323Agrawal, R., J. Gehrke, D. Gunopulos and P. Raghavan,19982794105Milenova, B.L. and M.M. Campos,2002O-Cluster: Scalable clustering of large high dimensional data sets.]]>2002pp: 290297Ester, M., H.P. Kriegel, J. Sander and X. Xu,19961996pp: 226231Pilevar, A.H. and M. Sukumar,2005269991010Hinneburg, A. and D.A. Keim,19981998pp: 5865Nagesh, H., S. Goil and A. Choudhary,20012001pp: 117Guha, S., R. Rastogi and K. Shim,19991999pp: 512521Jain, A.K. and R.C. Dubes,1988Abghari, H., M. Mahdavi, A. Fakherifard and A. Salajegheh,20092150159Lai, C.C. and C.Y. Chang,200936248259Bandyopadhyay, S. and S. Saha,20074034303451