Incomplete Multi-view Clustering with Joint Partition and Graph Learning
Date of Original Version
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 even noisy information especially for data with a large missing ratio. The latter relies on the initialization and ignores the geometric structure of data. To address these issues, we propose a novel Joint Partition and Graph (JPG) learning method for IMC. Specifically, JPG jointly 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. By this means, we transform incomplete multi-view data into a unified partition space and obtain the consensus graph in a mutual reinforcement manner. Moreover, a partition fusion strategy can allocate a large weight to the stretched base partition that is close to the unified matrix. The objective function is optimized in an alternating optimization fashion. Experimental results on several benchmark datasets demonstrate the effectiveness and superiority of JPG than the state-of-the-art baselines
IEEE Transactions on Knowledge and Data Engineering
Li, Lusi, Zhiqiang Wan, and Haibo He. "Incomplete Multi-view Clustering with Joint Partition and Graph Learning." IEEE Transactions on Knowledge and Data Engineering , (2021). doi:10.1109/TKDE.2021.3082470.