Consensus Graph Filter Learning for Multiple Graph Clustering

Multi-view Clustering (MVC) has gained significant attention for its ability to utilize consistent and complementary information from multiple views. Graph filter-based MVC methods have recently demonstrated promising performance, attracting growing interest. However, existing graph filter-based methods typically rely on a single filter for each view. These filters are usually derived from either a specific view or a consensus graph across all views, which limits their effectiveness in fully integrating multi-view information. To address this limitation, we propose a novel method, Consensus Graph Filter Learning for Multiple Graph Clustering (CGFMVC). Unlike existing methods that rely on a single filter per view, we construct multiple graph filters by integrating information from all views. For each view, we generate intra-view graph filters to intermediate high-order information and bridge local-global structures. This approach facilitates neighborhood smoothing and preserves local consistency within each view. By learning a consensus graph filter from these multiple filters, we effectively capture global complementary information across views while preserving local consistency. CGFMVC demonstrates excellent efficiency and effectiveness on various benchmark datasets, outperforming state-of-the-art methods. The code is publicly available at https://github.com/Sean-zjl/CGFMVC.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10890323
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Consensus Graph Filter Learning for Multiple Graph Clustering

Yuhua Qian, Liang Du, Peng Zhou, Chao Wen et al.
Advanced Graph Neural Networks
article

Consensus Graph Filter Learning for Multiple Graph Clustering

Yuhua Qian, Liang Du, Peng Zhou, Chao Wen, Yan Chen, Jiale Zou
article en

Abstract

Multi-view Clustering (MVC) has gained significant attention for its ability to utilize consistent and complementary information from multiple views. Graph filter-based MVC methods have recently demonstrated promising performance, attracting growing interest. However, existing graph filter-based methods typically rely on a single filter for each view. These filters are usually derived from either a specific view or a consensus graph across all views, which limits their effectiveness in fully integrating multi-view information. To address this limitation, we propose a novel method, Consensus Graph Filter Learning for Multiple Graph Clustering (CGFMVC). Unlike existing methods that rely on a single filter per view, we construct multiple graph filters by integrating information from all views. For each view, we generate intra-view graph filters to intermediate high-order information and bridge local-global structures. This approach facilitates neighborhood smoothing and preserves local consistency within each view. By learning a consensus graph filter from these multiple filters, we effectively capture global complementary information across views while preserving local consistency. CGFMVC demonstrates excellent efficiency and effectiveness on various benchmark datasets, outperforming state-of-the-art methods. The code is publicly available at https://github.com/Sean-zjl/CGFMVC.

Anhui University (CN), Shanxi University (CN), Taiyuan University of Technology (CN)
National Natural Science Foundation of China, Technology Development
Openalex Percentile: Top 98%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.