Large-Scale Multi-View Spectral Clustering via Bipartite Graph

Citations Over TimeTop 1% of 2015 papers

Abstract

In this paper, we address the problem of large-scale multi-view spectral clustering. In many real-world applications, data can be represented in various heterogeneous features or views. Different views often provide different aspects of information that are complementary to each other. Several previous methods of clustering have demonstrated that better accuracy can be achieved using integrated information of all the views than just using each view individually. One important class of such methods is multi-view spectral clustering, which is based on graph Laplacian. However, existing methods are not applicable to large-scale problem for their high computational complexity. To this end, we propose a novel large-scale multi-view spectral clustering approach based on the bipartite graph. Our method uses local manifold fusion to integrate heterogeneous features. To improve efficiency, we approximate the similarity graphs using bipartite graphs. Furthermore, we show that our method can be easily extended to handle the out-of-sample problem. Extensive experimental results on five benchmark datasets demonstrate the effectiveness and efficiency of the proposed method, where our method runs up to nearly 3000 times faster than the state-of-the-art methods.

Related Papers

• → Overlapping Community Detecting Based on Complete Bipartite Graphs in Micro-Bipartite Network Bi-Egonet(2019)8 cited
• → A NEW MODULARITY FOR DETECTING ONE-TO-MANY CORRESPONDENCE OF COMMUNITIES IN BIPARTITE NETWORKS(2010)22 cited
• → K − Bipartite Matching Extendability of Special Graphs(2011)
• 2-Bipartite Matching Extendability of C_n×P_2(2009)
• Bipartite Matching Extendability of Harary Graphs(2010)