| Título: | The K-Medoids Clustering Algorithm with Membrane Computing |
| Autores: |
Zhao, Yuzhen; Shandong Normal University Liu, Xiyu; Shandong Normal University Zhang, Hua; Yellow River Road Bridge Engineering Company |
| Fecha: | 2013-04-01 |
| Publicador: | TELKOMNIKA: Indonesian journal of electrical engineering |
| Fuente: |
 |
| Tipo: |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
| Tema: | No aplica |
| Descripción: | 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. |
| Idioma: | Inglés |