Site Tools



This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
Last revision Both sides next revision
en:software:recm [2009/04/22 14:26]
tdenoeux created
en:software:recm [2009/04/22 14:31]
Line 1: Line 1:
-toto+====== Relational Evidential c-means ====== 
 +A relational version of the evidential c-means (ECM) algorithm. As ECM, 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 alternating optimization algorithm similar to the fuzzy or possibilistic c-means algorithms. In contrast to ECM, RECM takes as input a proximity matrix. The method is described in: 
 +M.-H. Masson and T. Denoeux. RECM: Relational Evidential c-means algorithm. Pattern Recognition Letters, Accepted for publication, 2009.. {{en:revues:recm.pdf|pdf}} 

User Tools