Multi-view Clustering with Latent Low-rank Proxy Graph Learning

Jian Dai, Zhenwen Ren, Yunzhi Luo, Hong Song, Jian Yang*

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

10 引用 (Scopus)

摘要

With advances in information acquisition technologies, multi-view data are increasing dramatically in a variety of real-world applications, whereas such data is usually corrupted by noises and outliers. Many existing multi-view graph clustering (MVGC) methods usually learn a consensus affinity graph using a late-fusion scheme in semantic space, which compound the challenge of leveraging the underlying relationships among corrupted multi-view data. In this paper, we propose a novel clustering method for handing corrupted multi-view data, hereafter referred to as Latent Low-Rank Proxy Graph Learning (LLPGL). Specifically, by projecting the multi-view data into a low-dimension proxy feature space, LLPGL can learn a low-dimension yet low-rank latent proxy from corrupted view data. Meanwhile, by employing the adaptive neighbor graph learning over the clean proxy, a high-quality affinity graph can be learned for clustering purpose. Then, an effective optimization algorithm is proposed to solve the model of LLPGL. Experimental results on five widely used real-world benchmarks validate the effectiveness of the proposed method.Consequently, the proposed method can be used to cluster the corrupted multi-view data for real-life applications.

源语言英语
页(从-至)1049-1060
页数12
期刊Cognitive Computation
13
4
DOI
出版状态已出版 - 7月 2021

指纹

探究 'Multi-view Clustering with Latent Low-rank Proxy Graph Learning' 的科研主题。它们共同构成独一无二的指纹。

引用此