4.7 Article

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

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2022.3192445

关键词

Optimization; Clustering algorithms; Linear programming; Learning systems; Fuses; Time complexity; Noise measurement; Consistency; data clustering; efficient optimization; inconsistency; multi-view clustering; multi-view graph learning

资金

  1. NSFC [61976097, 61876193]
  2. Natural Science Foundation of Guangdong Province [2021A1515012203]
  3. Science and Technology Program of Guangzhou, China [202201010314]
  4. NSF [III-1763325, III-1909323, III-2106758, SaTC-1930941]

向作者/读者索取更多资源

This article introduces a new framework for multi-view graph learning, which models the consistency and inconsistency of multiple views in a unified objective function. It effectively handles low-quality or noisy datasets by designing an efficient optimization algorithm that can obtain an approximate solution in linear time complexity. Experimental results demonstrate the robustness and efficiency of the proposed approach.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据