International audienceThis paper introduces a new evidential clustering method based on the notion of "belief peaks" in the framework of belief functions. The basic idea is that all data objects in the neighborhood of each sample provide pieces of evidence that induce belief on the possibility of such sample to become a cluster center. A sample having higher belief than its neighbors and located far away from other local maxima is then characterized as cluster center. Finally, a credal partition is created by minimizing an objective function with the fixed cluster centers. An adaptive distance metric is used to fit for unknown shapes of data structures. We show that the proposed evidential clustering procedure has very good performance with...
International audienceTraditional evidential clustering tends to build clusters where the number of ...
International audienceIn this paper, a dynamic evidential clustering algorithm (DEC) is introduced t...
We study how to derive a fuzzy rule-based classification model using the theoretical framework of be...
International audienceIn evidential clustering, uncertainty about the assignment of objects to clust...
Evidential clustering based on the theory of belief functions has become one of the topics of machin...
International audienceIn this paper, we propose a clustering ensemble method based on Dempster-Shafe...
International audienceIn real clustering applications, proximity data, in which only pairwise simila...
International audienceIn the data mining field many clustering methods have been proposed, yet stand...
International audienceMedian clustering is of great value for partitioning relational data. In this ...
International audienceThe well-known Fuzzy C-Means (FCM) algorithm for data clustering has been exte...
International audienceCredal partitions in the framework of belief functions can give us a better un...
International audienceIn evidential clustering, the membership of objects to clusters is considered ...
AbstractA new online clustering method called E2GK (Evidential Evolving Gustafson–Kessel) is introdu...
International audienceA new online clustering method called E2GK (Evidential Evolving Gustafson-Kess...
International audienceTraditional evidential clustering tends to build clusters where the number of ...
International audienceIn this paper, a dynamic evidential clustering algorithm (DEC) is introduced t...
We study how to derive a fuzzy rule-based classification model using the theoretical framework of be...
International audienceIn evidential clustering, uncertainty about the assignment of objects to clust...
Evidential clustering based on the theory of belief functions has become one of the topics of machin...
International audienceIn this paper, we propose a clustering ensemble method based on Dempster-Shafe...
International audienceIn real clustering applications, proximity data, in which only pairwise simila...
International audienceIn the data mining field many clustering methods have been proposed, yet stand...
International audienceMedian clustering is of great value for partitioning relational data. In this ...
International audienceThe well-known Fuzzy C-Means (FCM) algorithm for data clustering has been exte...
International audienceCredal partitions in the framework of belief functions can give us a better un...
International audienceIn evidential clustering, the membership of objects to clusters is considered ...
AbstractA new online clustering method called E2GK (Evidential Evolving Gustafson–Kessel) is introdu...
International audienceA new online clustering method called E2GK (Evidential Evolving Gustafson-Kess...
International audienceTraditional evidential clustering tends to build clusters where the number of ...
International audienceIn this paper, a dynamic evidential clustering algorithm (DEC) is introduced t...
We study how to derive a fuzzy rule-based classification model using the theoretical framework of be...