4.7 Article

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

Journal

PATTERN RECOGNITION
Volume 41, Issue 4, Pages 1384-1397

Publisher

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

Keywords

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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available