中国矿业大学计算机科学与技术学院,江苏,徐州,221116
纸质出版:2012
移动端阅览
刘兵, 夏士雄, 周勇, 等. 基于样本加权的可能性模糊聚类算法[J]. 电子学报, 2012,40(2):371-375.
LIU Bing, XIA Shi-xiong, ZHOU Yong, et al. A Sample-Weighted Possibilistic Fuzzy Clustering Algorithm[J]. Acta Electronica Sinica, 2012, 40(2): 371-375.
刘兵, 夏士雄, 周勇, 等. 基于样本加权的可能性模糊聚类算法[J]. 电子学报, 2012,40(2):371-375. DOI: 10.3969/j.issn.0372-2112.2012.02.026.
LIU Bing, XIA Shi-xiong, ZHOU Yong, et al. A Sample-Weighted Possibilistic Fuzzy Clustering Algorithm[J]. Acta Electronica Sinica, 2012, 40(2): 371-375. DOI: 10.3969/j.issn.0372-2112.2012.02.026.
可能性模糊聚类算法解决了噪音敏感和一致性聚类问题
但算法假定每个待分析样本对聚类的贡献相同
导致离群点或噪声点对算法的干扰较强
算法迭代次数过大.为此
提出一种基于样本加权的可能性模糊聚类算法
新算法具有更快的收敛速度
对标准数据集和人工数据集加噪后的测试结果表明
该算法具有更强的鲁棒性
在有效降低时间复杂度的同时能够取得较好的聚类准确率.
The possibilistic fuzzy clustering algorithm overcomes the problem of sensitivity to noises and coincident clusters
but it assumes the contribution of each sample is equal
which leads to strong impact from outliers or noises and too many iterations.For this reason
this paper proposes a novel faster possibilistic fuzzy clustering algorithm based on the sample-weighted idea.The results of the experiments on standard data sets and synthetic data sets show that the sample-weighted algorithm is more robust against noises and outliers and reduces the time complexity effectively
and can obtain good clustering accuracy at the same time.
0
浏览量
3
下载量
13
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621