.png){kind=icon}
返回
Constrained bilinear factorization multi-view subspace clustering
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2020.105514.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-view clustering is an important and fundamental problem. Many multi-view subspace clustering methods have been proposed, and most of them assume that all views share a same coefficient matrix. However, the underlying information of multi-view data are not fully exploited under this assumption, since the coefficient matrices of different views should have the same clustering properties rather than be uniform among multiple views. To this end, this paper proposes a novel Constrained Bilinear Factorization Multi-view Subspace Clustering (CBF-MSC) method. Specifically, the bilinear factorization with an orthonormality constraint and a low-rank constraint is imposed for all coefficient matrices to make them have the same trace-norm instead of being equivalent, so as to explore the consensus information of multi-view data more fully. Finally, an Augmented Lagrangian Multiplier (ALM) based algorithm is designed to optimize the objective function. Comprehensive experiments tested on nine benchmark datasets validate the effectiveness and competitiveness of the proposed approach compared with several state-of-the-arts. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Multi-view clustering
Subspace clustering
Bilinear factorization
Low-rank representation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Multi-View Spectral Clustering via Integrating Global and Local Graphs通过集成全局和局部图的多视图谱聚类.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering用于子空间聚类的对偶图正则化潜在低秩表示
PREAI
分享收藏分享收藏
查看更多内容