A K-nearest Based Clustering Algorithm by P Systems with Active Membranes

The purpose of this paper is to propose a new way to solving clustering problems, which combines membrane computing with a k-nearest based algorithm inspired by chameleon algorithm. The new algorithm is defined as PKNBA, which can obtain the k-nearest graphs, complete the partition of subgraph through communication rules, evolution rules, dissolution rules and division rules in P system with active membranes. The whole process of PKNBA algorithm is shown by a 10 points test data set, which indicates the feasibility and less time consuming of the algorithm. All the processes are conducted in membranes. Cluster results via the famous iris and wine data set verify that the proposed PKNBA algorithm can cluster data set more accurate than k-means algorithm. The influences of parameters to the algorithm are illustrated also. The PKNBA provides an alternative for traditional computing.

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

[2]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[3]  Fouad Badran,et al.  A Topological Hierarchical Clustering: Application to Ocean Color Classification , 2001, ICANN.

[4]  Gheorghe Paun P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[5]  Weixin Xie,et al.  An Efficient Global K-means Clustering Algorithm , 2011, J. Comput..

[6]  Mario J. Pérez-Jiménez,et al.  Hierarchical Clustering with Membrane Computing , 2008, Comput. Informatics.

[7]  Gheorghe Paun,et al.  A quick introduction to membrane computing , 2010, J. Log. Algebraic Methods Program..

[8]  Linqiang Pan,et al.  Further remark on P systems with active membranes and two polarizations , 2006, J. Parallel Distributed Comput..

[9]  Ning Wang,et al.  A bio-inspired algorithm based on membrane computing and its application to gasoline blending scheduling , 2011, Comput. Chem. Eng..

[10]  Linqiang Pan,et al.  Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes , 2005, J. Parallel Distributed Comput..

[11]  Yu Zong,et al.  A Clustering Algorithm based on Local Accumulative Knowledge , 2013, J. Comput..

[12]  Alfonso Ortega,et al.  Distributed Simulation of P Systems by Means of Map-Reduce: First Steps with Hadoop and P-Lingua , 2011, IWANN.

[13]  Peng Wang,et al.  Applications of Text Clustering Based on Semantic Body for Chinese Spam Filtering , 2012, J. Comput..

[14]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..