摘要
This paper presents a new Section Set Adaptive FCM algorithm.The algorithm solved the shortcomings of local optimality,unsure classification and clustering numbers ascertained previously.And it improved on the architecture of FCM al- gorithm,enhanced the analysis for effective clustering.During the clustering processing,it may adjust clustering numbers dy- namically.Finally,it used the method of section set decreasing the time of classification.By experiments,the algorithm can im- prove dependability of clustering and correctness of classification.
This paper presents a new Section Set Adaptive FCM algorithm. The algorithm solved the shortcomings of local optimality, unsure classification and clustering numbers ascertained previously. And it improved on the architecture of FCM algorithm,enhanced the analysis for effective clustering. During the clustering processing,it may adjust clustering numbers dy- namically. Finally,it used the method of section set decreasing the time of classification. By experiments,the algorithm can im- prove dependability of clustering and correctness of classification.
出处
《现代电子技术》
2008年第4期100-102,共3页
Modern Electronics Technique
基金
Science and Researching Foundation of Jiamusi University(L2006-12)
关键词
模糊聚类算法
干扰检测
计算机技术
FCM
Fuzzy clustering
Clustering Numbers
Section Set Adaptive Algorithm
Network Security