An Improved Ranked K-medoids Clustering Algorithm Based on a P System

In this paper an improved ranked K-medoids algorithm by a specific cell-like P system is proposed which extends the application of membrane computing. First, we use the maximum distance method to choose the initial clustering medoids, maximum distance method which is based on the fact that the farthest initial medoids were the least likely assigned in the same cluster. And then, we realize this algorithm by a specific P system. P system is adequate to solve clustering problem for its high parallelism and lower computational time complexity. By computation of the designed system, one possible clustering result is obtained in a non-deterministic and maximal parallel way. Through example verification, our algorithm can improve the quality of clustering.