Spectral Perturbation Meets Incomplete Multi-view Data

2019-05-31 · Hao Wang, Linlin Zong, Bing Liu, Yan Yang, Wei Zhou

Beyond existing multi-view clustering, this paper studies a more realistic clustering scenario, referred to as incomplete multi-view clustering, where a number of data instances are missing in certain views. To tackle this problem, we explore spectral perturbation theory. In this work, we show a strong link between perturbation risk bounds and incomplete multi-view clustering. That is, as the similarity matrix fed into spectral clustering is a quantity bounded in magnitude O(1), we transfer the missing problem from data to similarity and tailor a matrix completion method for incomplete similarity matrix. Moreover, we show that the minimization of perturbation risk bounds among different views maximizes the final fusion result across all views. This provides a solid fusion criteria for multi-view data. We motivate and propose a Perturbation-oriented Incomplete multi-view Clustering (PIC) method. Experimental results demonstrate the effectiveness of the proposed method.

📄 PDF Abstract BibTeX arXiv:1906.00098

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringIncomplete multi-view clusteringMatrix Completion

Methods 이 논문이 사용한 방법론

Spectral Clustering Spectral clustering has attracted increasing attention due to the promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the…

Highly Efficient Rotation-Invariant Spectral Embedding for Scalable Incomplete Multi-View Clustering

2025-01-21 · Xinxin Wang, Yongshan Zhang, Yicong Zhou

Incomplete multi-view clustering presents significant challenges due to missing views. Although many existing graph-based methods aim to recover missing instances or complete similarity matrices with promising results, t…

Clustering Incomplete multi-view clustering

Spectral Feature Augmentation for Graph Contrastive Learning and Beyond

2022-12-02 · Yifei Zhang, Hao Zhu, Zixing Song, Piotr Koniusz 외

Although augmentations (e.g., perturbation of graph edges, image crops) boost the efficiency of Contrastive Learning (CL), feature level augmentation is another plausible, complementary yet not well researched strategy. …

Contrastive Learning

Clustering Result Re-guided Incomplete Multi-view Spectral Clustering

2025-10-11 · Jun Yin, Runcheng Cai, Shiliang Sun arxiv

Incomplete multi-view spectral clustering generalizes spectral clustering to multi-view data and simultaneously realizes the partition of multi-view data with missing views. For this category of method, K-means algorithm…

Learning Social Circles in Ego Networks based on Multi-View Social Graphs

2016-07-16 · Chao Lan, Yuhao Yang, Xiao-Li Li, Bo Luo 외

In social network analysis, automatic social circle detection in ego-networks is becoming a fundamental and important task, with many potential applications such as user privacy protection or interest group recommendatio…

Clustering

Tensor-Based Multi-View Block-Diagonal Structure Diffusion for Clustering Incomplete Multi-View Data

2021-06-09 · IEEE International Conference on Multimedia and Expo 2021 6 · Zhenglai Li, Chang Tang, Xinwang Liu, Xiao Zheng 외

In this paper, we propose a novel incomplete multi-view clustering method, in which a tensor nuclear norm regularizer elegantly diffuses the information of multi-view block-diagonal structure across different views. By e…