返回
Multiview Consensus Structure Discovery
DOI:10.1109/TCYB.2020.3013136.png)
摘要
En 中文
Multiview subspace learning has attracted much attention due to the efficacy of exploring the information on multiview features. Most existing methods perform data reconstruction on the original feature space and thus are vulnerable to noisy data. In this article, we propose a novel multiview subspace learning method, called multiview consensus structure discovery (MvCSD). Specifically, we learn the low-dimensional subspaces corresponding to different views and simultaneously pursue the structure consensus over subspace clustering for multiple views. In such a way, latent subspaces from different views regularize each other toward a common consensus that reveals the underlying cluster structure. Compared to existing methods, MvCSD leverages the consensus structure derived from the subspaces of diverse views to better exploit the intrinsic complementary information that well reflects the essence of data. Accordingly, the proposed MvCSD is capable of producing a more robust and accurate representation structure which is crucial for multiview subspace learning. The proposed method can be optimized effectively, with theoretical convergence guarantee, by alternatively iterating the argument Lagrangian multiplier algorithm and the eigendecomposition. Extensive experiments on diverse datasets demonstrate the advantages of our method over the state-of-the-art methods.
Keyword:
Robustness
Clustering algorithms
Task analysis
Data models
Dimensionality reduction
Cybernetics
Noise measurement
Consensus structure
multiview clustering
semisupervised classification
subspace learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Auto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised Classification用于图像聚类和半监督分类的自动加权多视图学习
Statistical monitoring of fed-batch process using dynamic multiway neighborhood preserving embedding使用动态多路邻域保持嵌入对分批过程进行统计监控

