Abstract
In this chapter, we present a multi objective genetic clustering approach, in which data points are assigned to clusters based on new line symmetry based distance. Two objective functions, one based on the Euclidean distance, Davies Bouldin (DB) index, and another line symmetry distance based objective function is used. The multiple randomized kd trees based nearest neighbor search is used to reduce the complexity of finding the closest symmetric points. Experimental results based on several artificial data sets show that proposed multi objective genetic clustering can obtain optimal clustering solutions in terms of different cluster quality measures and classification performance with compared to existing clustering algorithm SBKM.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
W. Miller, Symmetry groups and their applications (Academic Press, London, 1972)
H. Zabrodsky, S. Peleg, D. Avnir, Symmetry as a continuous feature. IEEE Trans. Pattern Anal. Mach. Intell. 17(12), 1154–1166 (1995)
M.C. Su, C.H. Chou, A modified version of the GCA algorithm with a distance based on cluster symmetry. IEEE Trans. Pattern Anal. Mach. Intell. 23(6), 674–680 (2001). doi:10.1109/34.927466
K.L. Chung, K.S. Lin, An efficient line symmetry-based GCA algorithm. Pattern Recogn. Lett. 27(7), 765–772 (2006). http://www.dx.doi.org/10.1016/j.patrec.2005.11.006
A.D. Gordon, Classification, 2nd edn. (Chapman & Hall, CRC, Boca Raton, 1999)
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Boston, 1989). http://www.amazon.com/Genetic-Algorithms-Optimization-Machine-Learning/dp/0201157675
C.A. Murthy, N. Chowdhury, In search of optimal clusters using genetic algorithms. Pattern Recogn. Lett. 17, 825–832 (1996). http://dl.acm.org/citation.cfm?id=235761
H.J. Lin, F.W. Yang, Y.T. Kao, An efficient GA-based clustering technique. Tamkang J. Sci. Eng. 8(2) 113–122 (2005). http://www2.tku.edu.tw/~tkjse/8-2/8-2-4.pdf
I.A. Sarafis, P.W. Trinder, A.M.S. Zalzala, NOCEA: a rule-based evolutionary algorithm for efficient and effective clustering of massive high-dimensional databases. Appl. Soft Comput. 7(3), 668–710 (2007). http://www.dl.acm.org/citation.cfm?id=1238435
V. Singh, L. Sahoo, A. Kelkar, in An Effective Clustering Algorithm for Data Mining. Proceedings of IEEE International Conference on Data Storage and Data Engineering, pp. 250–253. (2010). doi: 10.1109/DSDE.2010.34
V. Singh, L. Sahoo, A. Kelkar, Mining clusters in data sets of data mining: an effective algorithm. Int. J. Comput. Theory Eng. 3(1), 171–177 (2011). http://www.ijcte.org/papers/301-D255.pdf
D.C. Yao Zhao, C. Zheng, X. Zhang, A genetic clustering algorithm using a message-based similarity measure. Expert Syst. Appl. 39(2), 2194–2202 (2012). http://dx.doi.org/10.1016/j.eswa.2011.07.009
J.H. Freidman, J.L. Bentley, R.A. Finkel, An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 209–226 (1977)
L. Davies, D.W. Bouldin, A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1(2), 224–227 (1979). doi:10.1109/TPAMI.1979.4766909
J.H. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975)
S. Saha, S. Bandyopadhyay, A New Point Symmetry Based Fuzzy Genetic Clustering Technique for Automatic Evolution of Clusters. Inf. Sci. 179(19), 3230–3246 (2009).
M. Srinivas, L. Patnaik, Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. ManCybern. 24, 656–667 (1994). http://www.eprints.iisc.ernet.in/6971/2/adaptive.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Vijendra, S., Laxman, S. (2014). Multi Objective Line Symmetry Based Evolutionary Clustering Approach. In: Patnaik, S., Zhong, B. (eds) Soft Computing Techniques in Engineering Applications. Studies in Computational Intelligence, vol 543. Springer, Cham. https://doi.org/10.1007/978-3-319-04693-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-04693-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04692-1
Online ISBN: 978-3-319-04693-8
eBook Packages: EngineeringEngineering (R0)