4.7 Article

ECM:: An evidential version of the fuzzy c-means algorithm

期刊

PATTERN RECOGNITION
卷 41, 期 4, 页码 1384-1397

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.patcog.2007.08.014

关键词

clustering; unsupervised learning; Dempster-Shafer theory; evidence theory; belief functions; cluster validity; robustness

向作者/读者索取更多资源

A new clustering method for object data, called ECM (evidential c-means) is introduced, in the theoretical framework of belief functions. It is based on the concept of credal partition, extending those of hard, fuzzy, and possibilistic ones. To derive such a structure, a suitable objective function is minimized using an FCM-like algorithm. A validity index allowing the determination of the proper number of clusters is also proposed. Experiments with synthetic and real data sets show that the proposed algorithm can be considered as a promising tool in the field of exploratory statistics. (c) 2007 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据