Efficient Multi-view Clustering via Unified and Discrete Bipartite Graph Learning

by   Si-Guo Fang, et al.

Although previous graph-based multi-view clustering algorithms have gained significant progress, most of them are still faced with three limitations. First, they often suffer from high computational complexity, which restricts their applications in large-scale scenarios. Second, they usually perform graph learning either at the single-view level or at the view-consensus level, but often neglect the possibility of the joint learning of single-view and consensus graphs. Third, many of them rely on the k-means for discretization of the spectral embeddings, which lack the ability to directly learn the graph with discrete cluster structure. In light of this, this paper presents an efficient multi-view clustering approach via unified and discrete bipartite graph learning (UDBGL). Specifically, the anchor-based subspace learning is incorporated to learn the view-specific bipartite graphs from multiple views, upon which the bipartite graph fusion is leveraged to learn a view-consensus bipartite graph with adaptive weight learning. Further, the Laplacian rank constraint is imposed to ensure that the fused bipartite graph has discrete cluster structures (with a specific number of connected components). By simultaneously formulating the view-specific bipartite graph learning, the view-consensus bipartite graph learning, and the discrete cluster structure learning into a unified objective function, an efficient minimization algorithm is then designed to tackle this optimization problem and directly achieve a discrete clustering solution without requiring additional partitioning, which notably has linear time complexity in data size. Experiments on a variety of multi-view datasets demonstrate the robustness and efficiency of our UDBGL approach.


page 1

page 9

page 10

page 11


Effective and Efficient Graph Learning for Multi-view Clustering

Despite the impressive clustering performance and efficiency in characte...

Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and Simplicity

Despite significant progress, there remain three limitations to the prev...

Multi-view Graph Learning by Joint Modeling of Consistency and Inconsistency

Graph learning has emerged as a promising technique for multi-view clust...

One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering

The bipartite graph structure has shown its promising ability in facilit...

Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-view

Graph-based subspace clustering methods have exhibited promising perform...

Agglomerative Neural Networks for Multi-view Clustering

Conventional multi-view clustering methods seek for a view consensus thr...

Variational Graph Generator for Multi-View Graph Clustering

Multi-view graph clustering (MGC) methods are increasingly being studied...

Please sign up or login with your details

Forgot password? Click here to reset