The K-Medoids Clustering Algorithm with Membrane Computing

Yuzhen Zhao, Xiyu Liu, Hua Zhang

Abstract


The K-medoids clustering algorithm is realized by a P system in this paper. Because the membrane system has great parallelism and lower computational time complexity, it is suitable for solving combinatorial problems like the clustering problem. A P system with all the rules to solve the K-medoids algorithm was constructed. The specific P system is associated with the dissimilarity matrix between n objects. This system can get one possible classifications in a non-deterministic way. Through example test, it is appropriate for cluster analysis. This is a new attempt in applications of membrane system and it provides new ideas and methods for cluster analysis.

 

DOI: http://dx.doi.org/10.11591/telkomnika.v11i4.2383


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics