Fast Unfolding of Credal Partitions in Evidential Clustering - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Fast Unfolding of Credal Partitions in Evidential Clustering

Résumé

Evidential clustering, based on the notion of credal partition, has been successfully applied in many fields, reflecting its broad appeal and usefulness as one of the steps in exploratory data analysis. However, it is time-consuming due to the introduction of meta-cluster, which is regarded as a new cluster and defined by the disjunction (union) of several special (singleton) clusters. In this paper, a simple and fast method is proposed to extract the credal partition structure in evidential clustering based on modifying the iteration rule. By doing so, the invalid computation associated with meta-clusters is effectively eliminated. It is superior to known methods in terms of execution time. The results show the potential of the proposed method, especially in large data.
Fichier non déposé

Dates et versions

hal-03394844 , version 1 (22-10-2021)

Identifiants

Citer

Zuowei Zhang, Arnaud Martin, Zhunga Liu, Kuang Zhou, Yiru Zhang. Fast Unfolding of Credal Partitions in Evidential Clustering. 6th International Conference on Belief Functions, Oct 2021, Shanghai, China. pp.3-12, ⟨10.1007/978-3-030-88601-1_1⟩. ⟨hal-03394844⟩
41 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More