Parallel artificial immune clustering algorithm based on granular computing

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

When samples number, classification and dimension of clustering are much more, traditional clustering algorithm usually leads to unharmonious character between clustering and transcendent knowledge. Therefore, a new clustering algorithm is proposed, which is parallel artificial immune clustering algorithm based on granular computing. Artificial immune system model has the characteristics, such as parallel, random searching and maintaining diversity, which can solve premature problem in latter evolution and converge to a global optimization solution faster. Besides, we unite it to dynamic granulation model and apply granulation description to clustering. In the process of granulation changing, we can choose appropriate granulation size by adjusting to ensure clustering efficiency and quality. Tests show that the algorithm is more effective and more reasonable when we handle clustering of some data with it. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Xie, K., Hao, X., & Xie, J. (2007). Parallel artificial immune clustering algorithm based on granular computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4482 LNAI, pp. 208–215). Springer Verlag. https://doi.org/10.1007/978-3-540-72530-5_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free