Incomplete Multi-View Clustering With Joint Partition and Graph Learning

作     者：Li, Lusi Wan, Zhiqiang He, Haibo 

作者机构：Univ Rhode Isl Dept Elect & Comp Engn Kingston RI 02881 USA 

出 版 物：《IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING》 (IEEE Trans Knowl Data Eng)

年 卷 期：2023年第35卷第1期

页      面：589-602页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation [ECCS 1731672] 

主　　题：Incomplete multi-view clustering partition fusion graph learning 

摘      要：Incomplete multi-view clustering (IMC) aims to integrate the complementary information from incomplete views to improve clustering performance. Most existing IMC methods try to fill the incomplete views or directly learn a common representation based on matrix factorization or subspace learning. The former may introduce useless and/or even noisy information especially for data with a large missing rate. The latter relies on the initialization and ignores the data structures. To address these issues, we propose a novel Joint Partition and Graph (JPG) learning method for IMC. JPG can be formulated by two key components: unified partition space learning and consensus graph learning. The partition space is more robust to noise and the graph learning helps uncover the data structures. Specifically, JPG iteratively constructs local incomplete graph matrices, generates incomplete base partition matrices, stretches them to produce a unified partition matrix, and employs it to learn a consensus graph matrix. For efficiency, JPG adaptively allocates a large weight to the stretched base partition that is close to the unified partition, determines parameters, and imposes a low-rank constraint on graphs. Finally, the clusters can be obtained directly from the consensus graph. Experimental results on several benchmark datasets demonstrate the effectiveness and superiority of JPG over the state-of-the-art baselines.