Abstract
Membrane computing has a characteristic of great parallelism, so it has been applied in broad fields such as Biological modeling, NPC problems and combinatorial problems by reducing the computational time complexity greatly. In this paper we approach the problem of hierarchical clustering with a new method of membrane computing. An improved P system with external output is designed for finite set individuals with nonnegative integer variables. In the process of hierarchical clustering, the clustering is obtained depending on the dissimilarity between individuals or groups, so the less dissimilar two individuals are, the more similar they are. For an arbitrary matrix P Nk representing the values of N individuals, one possible hierarchy with clusters can be obtained by this improved P system in a non-deterministic way. The time complexity is polynomial in the number of individuals, the number of variables and the certain maximum value A * without increasing the complexity of the classical clustering algorithms. At the end of this paper, we cluster an example of dataset to obtain the final results. Through example test, we verify the feasibility and effectiveness of this improved P system to solve hierarchical clustering problems. A greater range of hierarchical clustering problems will be solved with this improved P system.
This work is supported by the Natural Science Foundation of China(No.61170038), Natural Science Foundation of Shandong Province, China (No.ZR2011FM001), Humanities and Social Sciences Project of Ministry of Education, China (No.12YJA630152), Social Science Fund of Shandong Province, China (No.11CGLJ22), Science-Technology Program of the Higher Education Institutions of Shandong Province, China (No.J12LN22).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cardona, M., Angels Colomer, M., Perez-Jimenez, M.J., Zaragoza, A.: Hierarchical Clustering with Membrane Computing. Computing and Informatics 27, 497–513 (2008)
Jia, Z.W., Cui, J., Yu, H.J.: Graph-Clustering Method Based on the Dissimilarity. Journal of Shanxi Agricultural University 29(3), 284–288 (2009)
Huang, C.Y., Dong, X.J., Long, H.: Solving Sorting Problem by P System. Journal of Shanghai Jiaotong University 42(2), 206–208 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, J., Liu, X. (2013). Hierarchical Clustering with Improved P System. In: Zu, Q., Hu, B., Elçi, A. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2012. Lecture Notes in Computer Science, vol 7719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37015-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-37015-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37014-4
Online ISBN: 978-3-642-37015-1
eBook Packages: Computer ScienceComputer Science (R0)