Abstract
In this paper, we propose a novel method which adopts evolutionary techniques so as to optimize a graph structure. The method that was developed has been applied in clustering problems, where spectral graph clustering technique has been used. In order to use evolutionary algorithms initial population has been created consisting of nearest neighbor graphs and variations of these graphs, which have been properly altered in order to form chromosomes. Since it was observed that initial population is crucial for the performance of the algorithm, several techniques have been considered for the creation. A fitness function was used in order to decide about the appropriateness of the chromosomes. The major advantage of our approach is that the algorithm is generic and can be used to all problems that are, or can be, modeled as graphs, such as dimensionality reduction and classification. Experiments have been conducted on a traditional dance dataset and other multidimensional datasets, providing encouraging results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31 3, 264–323 (1999)
Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recognition Letters 31(8), 651–666 (2010)
Jordan, M.I., Bach, F.R.: Learning spectral clustering. In: Advances in Neural Information Processing Systems 16 (2003)
Satu S.E.: Graph clustering. Comput. Sci. Rev. 1 1, 27–64 (2007)
Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Pattern Recognit. 33(9), 1455–1465 (2000)
Murthy, C.A., Chowdhury, N.: In search of optimal clusters using genetic algorithms. Pattern Recognit. Lett. 17(8), 825–832 (1996)
Eduardo H.R., Campello, R.G.B., Freitas, A.A., De Carvalho, A.C.P.L.F.: A survey of evolutionary algorithms for clustering. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 39(2), 133–155 (2009)
John H.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artific. 211 (1992)
Von, U.L.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)
Andrew Y.Ng., Jordan, M.I., Yair, W.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 2, 849–856 (2002)
Vendramin, L., Campello, R.J.G.B., Hruschka, E.R.: On the Comparison of Relative Clustering Validity Criteria, In: SDM, pp. 733–744 (2009)
Caliński, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat. Theory Methods 3(1), 1–27 (1974)
Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 2, 224–227 (1979)
Dunn, J.C.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95–104 (1974)
Ying, Z., Karypis, G.: Criterion functions for document clustering: experiments and analysis. Technical Report (2001)
Eissen, Z., Meyer, B.S.S., Wißbrock, F.: On cluster validity and the information need of users, pp. 216–221. ACTA Press (2003)
Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)
He, Z., Xu, X., Deng, S.: K-ANMI: a mutual information based clustering algorithm for categorical data (2005)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. PhD diss., PhD thesis, University of Michigan, Dissertation Abstracts International. 36(10) (1975)
Iosifidis, A., Tefas, A., Ioannis, P.: Minimum class variance extreme learning machine for human action recognition. IEEE Trans. Circ. Syst. Video Technol. 23(11), 1968–1979 (2013)
Acknowledgments
This research has been co–financed by the European Union (European Social Fund—ESF) and Greek national funds through the Operation Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF)—Research Funding Program: THALIS–UOA–ERASITECHNIS MIS 375435.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Chrysouli, C., Tefas, A. (2016). Evolution of Graphs for Unsupervised Learning. In: Merelo, J.J., Rosa, A., Cadenas, J.M., Dourado, A., Madani, K., Filipe, J. (eds) Computational Intelligence. IJCCI 2014. Studies in Computational Intelligence, vol 620. Springer, Cham. https://doi.org/10.1007/978-3-319-26393-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-26393-9_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26391-5
Online ISBN: 978-3-319-26393-9
eBook Packages: EngineeringEngineering (R0)