Accurate Complementarity Learning for Graph-Based Multiview Clustering.

Abstract

In real scenarios, graph-based multiview clustering has clearly shown popularity owing to the high efficiency in fusing the information from multiple views. Practically, the multiview graphs offer both consistent and inconsistent cues as they usually come from heterogeneous sources. Previous methods illustrated the importance of leveraging the multiview consistency and inconsistency for accurate modeling. However, when fusing the graphs, the inconsistent parts are generally ignored and hence the valued view-specific attributes are lost. To solve this problem, we propose an accurate complementarity learning (ACL) model for graph-based multiview clustering. ACL clearly distinguishes the consistent, complementary, and noise and corruption terms from the initial multiview graphs. In contrast to existing models that overlooked the complementary information, we argue that the view-specific characteristics extracted from the complementary terms are beneficial for affinity learning. In addition, ACL exploits only the positive parts of the complementary information for preserving the evidence on the positive sample relationship, and ignores the negative cues to avoid the vanishing of effective affinity strengths. This way, the learned affinity matrix is able to properly balance the consistent and complementary information. To solve the ACL model, we introduce an efficient alternating optimization algorithm with a varying penalty parameter. Experiments on synthetic and real-world databases clearly demonstrated the superiority of ACL.