ECM+: An improved evidential c-means with adaptive distance

Evidential c-means (ECM) is a prototype-based clustering algorithm that generates a credal partition. Such a partition encompasses the notions that can be encountered with a hard, fuzzy or possibilistic partition, allowing the representation of various situations concerning the class membership of an object. The ECM method provides a prototype for each subset of the possible classes, calculated by averaging the prototypes of the classes included in the subsets. Although this definition perfectly suits ECM when employing a Euclidean distance , it becomes inappropriate when using a Mahalanobis distance . In this context, a new definition of prototypes for the subsets is proposed. The ECM objective function is then optimized using the new definition of prototypes. The subsequent algorithm, named ECM+, is finally tested on various synthetic and real data sets to demonstrate its interest compared to ECM.

Authors

Publication Details

Journal
Fuzzy Sets and Systems
Published
2024-10-25
DOI
https://doi.org/10.1016/j.fss.2024.109168
Citations
2
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
0.72
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ECM+: An improved evidential c-means with adaptive distance

Jonas Koko, Violaine Antoine, Benoît Albert
2 citations
Fuzzy Sets and Systems
Rough Sets and Fuzzy Logic
0.72
article

ECM+: An improved evidential c-means with adaptive distance

Jonas Koko, Violaine Antoine, Benoît Albert
article en
2 citations

Abstract

Evidential c-means (ECM) is a prototype-based clustering algorithm that generates a credal partition. Such a partition encompasses the notions that can be encountered with a hard, fuzzy or possibilistic partition, allowing the representation of various situations concerning the class membership of an object. The ECM method provides a prototype for each subset of the possible classes, calculated by averaging the prototypes of the classes included in the subsets. Although this definition perfectly suits ECM when employing a Euclidean distance , it becomes inappropriate when using a Mahalanobis distance . In this context, a new definition of prototypes for the subsets is proposed. The ECM objective function is then optimized using the new definition of prototypes. The subsequent algorithm, named ECM+, is finally tested on various synthetic and real data sets to demonstrate its interest compared to ECM.

Fuzzy Sets and SystemsVol. 498
Openalex Percentile: Top 25%
Rough Sets and Fuzzy Logic
0.72
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.