Higher Order Multiple Graph Filtering for Structured Graph Learning
Lists
Only you see this
Abstract
In the field of machine learning, multi-view clustering aims to reveal hidden clustering patterns across different data perspectives. However, traditional methods often struggle due to their reliance on low-order similarity data. To overcome this, we propose a new approach that integrates the learning of multiple graph filters, approximated through Chebyshev polynomials, with consensus structural graph learning into a unified framework. This method fully utilizes high-order statistical information from multiple data sources, thereby enhancing multi-view clustering. Comprehensive experiments conducted on multiple datasets consistently demonstrate significant performance improvements over traditional methods. Code is available at https://github.com/lxd1204/HMGC.
BibTeX
@inproceedings{du2024higher,
author = {Liang Du and Xiaodong Li and Yan Chen and Gui Yang and Mian Ilyas Ahmad and Peng Zhou},
title = {{Higher Order Multiple Graph Filtering for Structured Graph Learning}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2024},
doi = {10.1109/icassp48485.2024.10446826},
}Loading related content...