4.7 Article

Self-taught Multi-view Spectral Clustering

期刊

PATTERN RECOGNITION
卷 138, 期 -, 页码 -

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2023.109349

关键词

Graph clustering; spectral rotation; spectral clustering; multi -view clustering

向作者/读者索取更多资源

By integrating multiple views, multi-view learning can improve the performance of learning tasks by discovering underlying data structures. Multi-view clustering, as a basic and important branch of multi-view learning, has achieved great success recently. However, most existing multi-view spectral clustering methods may significantly affect clustering performance due to information loss between independent steps. In this paper, a novel Self-taught Multi-view Spectral Clustering (SMSC) framework is proposed to address this issue, and experimental results show that our methods out-perform other state-of-the-art baselines.
By integrating multiple views, i.e., multi-view learning (ML), we can discover the underlying data struc-tures so that the performance of learning tasks can improve. As a basic and important branch of ML, multi-view clustering has achieved great success recently in pattern recognition and machine learning communities. Most existing multi-view spectral clustering methods heavily adopt the relax-and-discretize strategy to obtain discrete cluster labels (clustering results), i.e., using predefined similarity graphs to learn a consensus Laplacian embedding shared by all views for K-means clustering. However, the above clustering strategy may significantly affect clustering performance since there is information loss be-tween independent steps. In this paper, we establish a novel Self-taught Multi-view Spectral Clustering (SMSC) framework to address the above issue. As the main contributions of this paper, we provide two versions of SMSC based on convex combination and centroid graph fusion schemes. Specifically, a self-taught mechanism is introduced in SMSC, which can effectively f eedback the manifold structure induced by Laplacian embedding and the cluster information hidden in the discrete indicator matrix to learn an optimal consensus similarity graph for graph partitioning. The effectiveness of the proposed methods has been evaluated on real-world multi-view datasets, and experimental results show that our methods out-perform other state-of-the-art baselines. (c) 2023 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据