GA-Based Membrane Evolutionary Algorithm for Ensemble Clustering

Ensemble clustering can improve the generalization ability of a single clustering algorithm and generate a more robust clustering result by integrating multiple base clusterings, so it becomes the focus of current clustering research. Ensemble clustering aims at finding a consensus partition which agrees as much as possible with base clusterings. Genetic algorithm is a highly parallel, stochastic, and adaptive search algorithm developed from the natural selection and evolutionary mechanism of biology. In this paper, an improved genetic algorithm is designed by improving the coding of chromosome. A new membrane evolutionary algorithm is constructed by using genetic mechanisms as evolution rules and combines with the communication mechanism of cell-like P system. The proposed algorithm is used to optimize the base clusterings and find the optimal chromosome as the final ensemble clustering result. The global optimization ability of the genetic algorithm and the rapid convergence of the membrane system make membrane evolutionary algorithm perform better than several state-of-the-art techniques on six real-world UCI data sets.

[1]  W. Marsden.  I and J , 2012 .

[2]  Xiangrong Liu,et al.  Asynchronous spiking neural P systems with rules on synapses , 2015, Neurocomputing.

[3]  Xiaoyi Jiang,et al.  Ensemble Clustering via Random Walker Consensus Strategy , 2010, 2010 20th International Conference on Pattern Recognition.

[4]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[5]  Tao Li,et al.  On combining multiple clusterings: an overview and a new perspective , 2010, Applied Intelligence.

[6]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[7]  Gheorghe Paun,et al.  On the power of membrane division in P systems , 2004, Theor. Comput. Sci..

[8]  Athanasios V. Vasilakos,et al.  Cell-Like Spiking Neural P Systems With Request Rules , 2017, IEEE Transactions on NanoBioscience.

[9]  Ah-Hwee Tan,et al.  Modified ART 2A growing network capable of generating a fixed number of nodes , 2004, IEEE Transactions on Neural Networks.

[10]  Mark Collins,et al.  AI Techniques for Game Programming , 2002 .

[11]  Dipak V. Patil,et al.  A Survey on K-means Based Consensus Clustering , 2016 .

[12]  Xiyu Liu,et al.  A Cluster Splitting Technique by Hopfield Networks and P Systems on Simplices , 2017, Neural Processing Letters.

[13]  Xiangxiang Zeng,et al.  Homogeneous Spiking Neural P Systems , 2009, Fundam. Informaticae.

[14]  Ana L. N. Fred,et al.  Combining multiple clusterings using evidence accumulation , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Dan A. Simovici,et al.  Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms , 2002, J. Univers. Comput. Sci..

[16]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[17]  Linqiang Pan,et al.  Cell-like spiking neural P systems , 2016, Theor. Comput. Sci..

[18]  Hui Xiong,et al.  K-Means-Based Consensus Clustering: A Unified View , 2015, IEEE Transactions on Knowledge and Data Engineering.

[19]  Carla E. Brodley,et al.  Solving cluster ensemble problems by bipartite graph partitioning , 2004, ICML.

[20]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[21]  Oscar H. Ibarra,et al.  On spiking neural P systems , 2006, Natural Computing.

[22]  Linqiang Pan,et al.  On Languages Generated by Cell-Like Spiking Neural P Systems , 2016, IEEE Transactions on NanoBioscience.

[23]  Xin Wang,et al.  Spatial Cluster Analysis by the Adleman-Lipton DNA Computing Model and Flexible Grids , 2012 .

[24]  Minghe Sun,et al.  An Improved Apriori Algorithm Based on an Evolution-Communication Tissue-Like P System with Promoters and Inhibitors , 2017 .

[25]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[26]  Xi Wang,et al.  Clustering aggregation by probability accumulation , 2009, Pattern Recognit..

[27]  John Holland,et al.  Adaptation in Natural and Artificial Sys-tems: An Introductory Analysis with Applications to Biology , 1975 .

[28]  Witold Pedrycz,et al.  An Efficient Solution of Real-Time Fuzzy Regression Analysis to Information Granules Problem , 2012, J. Adv. Comput. Intell. Intell. Informatics.

[29]  Chang-Dong Wang,et al.  Robust Ensemble Clustering Using Probability Trajectories , 2016, IEEE Transactions on Knowledge and Data Engineering.

[30]  Anil K. Jain,et al.  Clustering ensembles: models of consensus and weak partitions , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[31]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[32]  Jian Yu,et al.  Clustering Ensembles Based on Normalized Edges , 2007, PAKDD.

[33]  Xiyu Liu,et al.  Communication P Systems on Simplicial Complexes with Applications in Cluster Analysis , 2012 .

[34]  Xiyu Liu,et al.  Spiking Neural P Systems with Neuron Division and Dissolution , 2016, PloS one.

[35]  Yun Yang,et al.  Temporal Data Clustering via Weighted Clustering Ensemble with Different Representations , 2011, IEEE Transactions on Knowledge and Data Engineering.