Fast Unfolding of Credal Partitions in Evidential Clustering

Zuowei Zhang, Arnaud Martin, Zhunga Liu, Kuang Zhou, Yiru Zhang

科研成果: 书/报告/会议事项章节会议稿件同行评审

1 引用 (Scopus)

摘要

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.

源语言英语
主期刊名Belief Functions
主期刊副标题Theory and Applications - 6th International Conference, BELIEF 2021, Proceedings
编辑Thierry Denœux, Eric Lefèvre, Zhunga Liu, Frédéric Pichon
出版商Springer Science and Business Media Deutschland GmbH
3-12
页数10
ISBN(印刷版)9783030886004
DOI
出版状态已出版 - 2021
活动6th International Conference on Belief Functions, BELIEF 2021 - Virtual, Online
期限: 15 10月 202119 10月 2021

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
12915 LNAI
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议6th International Conference on Belief Functions, BELIEF 2021
Virtual, Online
时期15/10/2119/10/21

指纹

探究 'Fast Unfolding of Credal Partitions in Evidential Clustering' 的科研主题。它们共同构成独一无二的指纹。

引用此