A new clustering algorithm for proximity data, called RECM (Relational evidential c-means) is presented. This algorithm generates a credal partition, a new clustering structure based on the theory of belief functions, which extends the existing concepts of hard, fuzzy and possibilistic partitions. Two algorithms, EVCLUS (Evidential Clustering) and ECM (Evidential c-Means) were previously available to derive credal partitions from data. EVCLUS was designed to handle proximity data, whereas ECM is a direct extension of fuzzy clustering algorithms for vectorial data. In this article, the relational version of ECM is introduced. It is compared to EVCLUS using various datasets. It is shown that RECM provides similar results to those given by EVCLUS. However, the optimization procedure of RECM, based on an alternate minimization scheme, is computationally much more efficient than the gradient-based procedure used in EVCLUS.
In REF Relational evidential c-means (RECM) was proposed to generates a credal partition.
RECM: Relational Evidential c-means algorithm
Pattern Recognit. Lett.
Pattern Recognit. Lett.
Mathematics Computer Science