Multi-View Graph Learning by Joint Modeling of Consistency and Inconsistency
Top Cited Papers
- 27 July 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (2) , 2848-2862
Abstract
Graph learning has emerged as a promising technique for multi-view clustering due to its ability to learn a unified and robust graph from multiple views. However, existing graph learning methods mostly focus on the multi-view consistency issue, yet often neglect the inconsistency between views, which makes them vulnerable to possibly low-quality or noisy datasets. To overcome this limitation, we propose a new multi-view graph learning framework, which for the first time simultaneously and explicitly models multi-view consistency and inconsistency in a unified objective function, through which the consistent and inconsistent parts of each single-view graph as well as the unified graph that fuses the consistent parts can be iteratively learned. Though optimizing the objective function is NP-hard, we design a highly efficient optimization algorithm that can obtain an approximate solution with linear time complexity in the number of edges in the unified graph. Furthermore, our multi-view graph learning approach can be applied to both similarity graphs and dissimilarity graphs, which lead to two graph fusion-based variants in our framework. Experiments on 12 multi-view datasets have demonstrated the robustness and efficiency of the proposed approach. The code is available at https://github.com/youweiliang/Multi-view_Graph_Learning.Keywords
All Related Versions
Funding Information
- NSFC (61976097, 61876193)
- Natural Science Foundation of Guangdong Province (2021A1515012203)
- Science and Technology Program of Guangzhou, China (202201010314)
- NSF (III-1763325, III-1909323, III- 2106758, SaTC-1930941)
This publication has 44 references indexed in Scilit:
- Knowledge propagation in large image databases using neighborhood information2011
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010
- NUS-WIDE2009
- On Nonconvex Quadratic Programming with Box ConstraintsSIAM Journal on Optimization, 2009
- A tutorial on spectral clusteringStatistics and Computing, 2007
- The Amsterdam Library of Object ImagesInternational Journal of Computer Vision, 2005
- Standard Quadratic Optimization Problems: Algorithms2001
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations1997
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955