Design of K-Means Clustering Algorithm Based on Distance Concentration

Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium(2009)

引用 1|浏览0
暂无评分
摘要
Using the immune recognizing principle, the data object to cluster was denoted as the antigens set, and the clustering center was the antibodies set. The clustering was the process to obtain the best antibodies to catch the antigens by producing the antibodies and recognizing the antigens unceasingly. The distance concentration and the affinity, between antibody and antigen, and between antibody and antibody, were defined about the K-means clustering; the antibody reproduction function was proposed. The antibody cloning algorithm was presented. The experimental results show that the algorithm not only avoids the local optima and is robust to initialization, but also increases the convergence speed.
更多
查看译文
关键词
antibody reproduction function,antigens unceasingly,k-means,pattern clustering,pattern recognition,clustering algorithm,immune recognizing principle,best antibody,k-means clustering algorithm,k-means clustering,set theory,convergence speed,clustering center,k-means clustering algorithm design,distance concentration,antigens set,antibodies set,data clustering,aritificial immune system,cloning,optimization,genetics,algorithm design and analysis,robustness,genetic algorithms,convergence,iris,k means,k means clustering,immune system,electronic commerce,clustering algorithms,data security,gallium
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要