Quantum behaved particle swarm optimization for data clustering with multiple objectives

Clustering is an important tool in many fields such as exploratory data mining and pattern recognition. It consists in organizing a large data set into groups of objects that are more similar to each other than to those in other groups. Despite its use for over three decades, it is still subject to a lot of controversy. In this paper, we cast clustering as a Pareto based multi-objective optimization problem which is handled using a quantum behaved particle swarm optimization algorithm. The search process is carried out over the space of cluster centroids with the aim to find partitions that optimize two objectives simultaneously, namely compactness and connectivity. Global best leader selection is performed using a hybrid method based on sigma values and crowding distance. The proposed algorithm has been tested using synthetic and real data sets and compared to the state of the art methods. The results obtained are very competitive and display good performance both in terms of the cluster validity measure and in terms of the ability to find trade-off partitions especially in the case of close clusters.

[1]  Eréndira Rendón,et al.  Internal versus External cluster validation indexes , 2011 .

[2]  Mohamed-Khireddine Kholladi,et al.  A quantum evolutionary algorithm for data clustering , 2010, Int. J. Data Min. Model. Manag..

[3]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[4]  Alex Alves Freitas,et al.  A Survey of Evolutionary Algorithms for Clustering , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[5]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[6]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[7]  Joshua D. Knowles,et al.  An Evolutionary Approach to Multiobjective Clustering , 2007, IEEE Transactions on Evolutionary Computation.

[8]  Mohamed-Khireddine Kholladi,et al.  Improvements to the quantum evolutionary clustering , 2013, Int. J. Data Anal. Tech. Strateg..

[9]  Wenbo Xu,et al.  Particle swarm optimization with particles having quantum behavior , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[10]  Ata Kabán,et al.  Constrained Multi-objective Optimization Using a Quantum Behaved Particle Swarm , 2012, ICONIP.

[11]  Ata Kabán,et al.  On extending quantum behaved particle swarm optimization to multiobjective context , 2012, 2012 IEEE Congress on Evolutionary Computation.

[12]  P. Bertone,et al.  Integrative data mining: the new direction in bioinformatics , 2001, IEEE Engineering in Medicine and Biology Magazine.

[13]  Ujjwal Maulik,et al.  Multiobjective Genetic Clustering for Pixel Classification in Remote Sensing Imagery , 2007, IEEE Transactions on Geoscience and Remote Sensing.

[14]  Jianhong Wu,et al.  Data clustering - theory, algorithms, and applications , 2007 .

[15]  Giansalvatore Mecca,et al.  A new algorithm for clustering search results , 2007, Data Knowl. Eng..

[16]  Claudio Carpineto,et al.  A lattice conceptual clustering system and its application to browsing retrieval , 2004, Machine Learning.

[17]  Ujjwal Maulik,et al.  Multiobjective Genetic Algorithms for Clustering - Applications in Data Mining and Bioinformatics , 2011 .

[18]  Anil K. Jain.  Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[19]  Joshua D. Knowles,et al.  Improvements to the scalability of multiobjective clustering , 2005, 2005 IEEE Congress on Evolutionary Computation.

[20]  Jürgen Teich,et al.  Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO) , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).