Incomplete Multiview Nonnegative Representation Learning with Multiple Graphs
17
TL;DR: Zhang et al. as discussed by the authors developed an effective incomplete multiview nonnegative representation learning (IMNRL) framework, which is suitable for incomplete multi-view clustering in various situations.
read more
About: This article is published in Pattern Recognition. The article was published on 01 Mar 2022. and is currently open access. The article focuses on the topics: Embedding & Cluster analysis.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Low-Rank Tensor Regularized Views Recovery for Incomplete Multiview Clustering.
TL;DR: Zhang et al. as discussed by the authors proposed a Low-rAnk Tensor regularized viEws Recovery (LATER) method for IMVC, which jointly reconstructs and utilizes the missing views and learns multilevel graphs for comprehensive similarity discovery in a unified model.
35
Incomplete Multiview Nonnegative Representation Learning With Graph Completion and Adaptive Neighbors
TL;DR: In this article , the authors propose a novel Incomplete multiview nonnegative representation learning model with graph completion and adaptive neighbors (IMNGA), which performs common graph learning, missing graph completion, and consensus nonnegative representations simultaneously, where the common graph on all views and the incomplete graph of each view are used to reconstruct the completed graph of the corresponding view.
13
Multiview Jointly Sparse Discriminant Common Subspace Learning
TL;DR: In this paper , a generalized robust multiview discriminant analysis (GRMDA) is proposed to obtain a linear transform for each view and for learning multi-view jointly sparse discriminant common subspace, which can achieve both maximal between-class and minimal within-class variation for data from multiple views in a common space.
11
Incomplete multi-view learning: Review, analysis, and prospects
Jingjing Tang,Qingqing Yi,Saiji Fu,Yingjie Tian +3 more
TL;DR: This survey reviews incomplete multi-view learning (IML), analyzing its generative and discriminative perspectives, missing scenarios, and learning tasks, highlighting practical applications and future research directions to adapt IML for incomplete data and complex missing scenarios.
9
Incremental unsupervised feature selection for dynamic incomplete multi-view data
TL;DR: Wang et al. as mentioned in this paper proposed an Incremental Incomplete Multi-view Unsupervised Feature Selection method (I2MUFS) on incomplete multi-view streaming data, which embeds the unsupervised feature selection into an extended weighted non-negative matrix factorization model.
References
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
•Proceedings Article
Proceedings of the International Joint Conference on Artificial Intelligence 2007
Alan Bundy
- 01 Jan 2007
2.1K
Fast spectral methods for ratio cut partitioning and clustering
L. Hagen,Andrew B. Kahng +1 more
- 01 Jan 1991
TL;DR: It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approximation of the optimal ratio cut partition cost.
•Proceedings Article
Co-regularized Multi-view Spectral Clustering
Abhishek Kumar,Piyush Rai,Hal Daumé +2 more
- 12 Dec 2011
TL;DR: A spectral clustering framework is proposed that achieves this goal by co-regularizing the clustering hypotheses, and two co- regularization schemes are proposed to accomplish this.
Multi-view clustering via joint nonnegative matrix factorization
Jing Gao,Jiawei Han,Jialu Liu,Chi Wang +3 more
- 01 Jan 2013
TL;DR: This paper proposes a novel NMFbased multi-view clustering algorithm by searching for a factorization that gives compatible clustering solutions across multiple views and designs a novel and effective normalization strategy inspired by the connection between NMF and PLSA.