跳到主要导航 跳到搜索 跳到主要内容

Deep evidential clustering based on feature representation learning and belief function theory

  • Northwestern Polytechnical University Xian
  • Xi'an University of Architecture and Technology

科研成果: 期刊稿件 › 文章 › 同行评审

6 引用 (Scopus)

摘要

Evidential clustering is a promising clustering framework based on belief function theory which generalizes hard, fuzzy, possibilistic, and rough clustering. It allows us to gain deeper insight into the structure of the data. However, traditional evidential clustering algorithms cannot deal well with high-dimensional raw data such as text and images by the way of clustering on the original data representations directly. To address this problem, a deep evidential clustering (DEC) algorithm based on feature representation learning and belief function theory is proposed in this study. This algorithm incorporates the evidential clustering loss, the autoencoder reconstruction loss, and the regularization loss of network parameters to construct a combined optimization model. DEC performs deep feature extraction and evidential clustering simultaneously to ensure that the learned deep features are the evidential clustering-friendly representations of the raw data. In addition, DEC introduces evidential partition so that an object can belong to either a single class or any subset of a collection of classes, which provides more powerful expressive ability for uncertain data. Extensive experiments were conducted on real high-dimensional datasets, and the experimental results illustrated the superiority of DEC compared to the state-of-the-art evidential clustering and deep clustering algorithms.

源语言英语
期刊论文编号111261
期刊Pattern Recognition
卷161
DOI
出版状态已出版 - 5月 2025

学术指纹

探究 'Deep evidential clustering based on feature representation learning and belief function theory' 的科研主题。它们共同构成独一无二的学术指纹。

引用此