Union Coding Based Immune Clone Selection Unsupervised Clustering Algorithm
Authors
Lichao Mou, Xiaoying Pan
Corresponding Author
Lichao Mou
Available Online August 2012.
- DOI
- 10.2991/iccasm.2012.346How to use a DOI?
- Keywords
- Union coding, Immune, Unsupervised clustering, Minimum spanning tree
- Abstract
A new union based coding based immune clone selection clustering algorithm is proposed in this paper. The algorithm designs a coding method which synthesizes number of clusters and cluster centers, without first specifying the number of clusters, effectively overcoming the dependency on the domain knowledge. At the same time, generate clustering results by immune clone operator, and get the final results by the lopping operation of minimum spanning tree. Experimental results show that the methods can cluster for different types of data sets properly and can determine the appropriate number of clusters.
- Copyright
- © 2012, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lichao Mou AU - Xiaoying Pan PY - 2012/08 DA - 2012/08 TI - Union Coding Based Immune Clone Selection Unsupervised Clustering Algorithm BT - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012) PB - Atlantis Press SP - 1352 EP - 1355 SN - 1951-6851 UR - https://doi.org/10.2991/iccasm.2012.346 DO - 10.2991/iccasm.2012.346 ID - Mou2012/08 ER -