Efficient Integration of Multi-View Attributed Graphs for Clustering and Embedding
Yiran Li, Gongyao Guo, Jieming Shi, Sibo Wang, Qing Li
Abstract
A multi-view attributed graph (MVAG)captures the diverse relationships and properties of real-world entities through multiple graph views and attribute views. Effectively utilizing all views inis essential for MVAG clustering and embedding, which are important for applications like recommendation systems, anomaly detection, social network analysis, etc. Existing methods either achieve inferior result quality or incur significant computational costs to handle large-scale MVAGs. In this paper, we present a spectrum-guided Laplacian aggregation scheme with an effective objective formulation and two efficient algorithms SGLA and SGLA+, to cohesively integrate all views ofinto an MVAG Laplacian matrix, which readily enables classic graph algorithms to handlewith superior performance in clustering and embedding tasks. We begin by conducting a theoretical analysis to design an integrated objective that consists of two components, the eigengap and connectivity objectives, aiming to link the spectral properties of the aggregated MVAG Laplacian with the underlying community and connectivity properties of. A constrained optimization problem is then formulated for the integration, which is computationally expensive to solve. Thus, we first develop the SGLA algorithm, which already achieves excellent performance compared with existing methods. To further enhance efficiency, we design SGLA+ to reduce the number of costly objective evaluations via sampling and approximation to quickly find an approximate optimum. Extensive experiments compare our methods against 12 baselines for clustering and 8 baselines for embedding on 8 multi-view attributed graphs, validating the superior performance of SGLA and SGLA+ in terms of result quality and efficiency. Compared with the most effective baselines, our methods are significantly faster, often by up to orders of magnitude. Our implementation is available at https://github.com/CyanideCentral/SGLA/.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2c098f6f-da9b-4658-b15d-aa8bfda4040fBuilds on9
- Unsupervised Attributed Multiplex Network EmbeddingChanyoung Park, Donghyun Kim, Jiawei Han, Hwanjo YuAAAI 2020 · 333 citations
- Multi-view Contrastive Graph ClusteringErlin Pan, Zhao KangNeurIPS 2021 · 316 citations
- HDMI: High-order Deep Multiplex InfomaxBaoyu Jing, Chanyoung Park, Hanghang TongWWW 2021 · 199 citations
- Scaling Attributed Network Embedding to Massive GraphsRenchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang et al.VLDB 2021 · 62 citations
- A Novel Approach to Learning Consensus and Complementary Information for Multi-View Data ClusteringKhanh Luong, Richi NayakICDE 2020 · 40 citations
Related papers
- Large-Scale Multi-View Subspace Clustering in Linear TimeZhao Kang, Wangtao Zhou, Zhitong Zhao, Junming Shao et al.AAAI 2020 · 574 citations
- Fast Multi-view Discrete Clustering with Anchor GraphsQianyao Qiang, Bin Zhang, Fei Wang, Feiping NieAAAI 2021 · 86 citations
- Multi-View Spectral Clustering with Optimal Neighborhood Laplacian MatrixSihang Zhou, Xinwang Liu, Jiyuan Liu, Xifeng Guo et al.AAAI 2020 · 56 citations
- Spectral Subspace Clustering for Attributed GraphsXiaoyang Lin, Renchi Yang, Haoran Zheng, Xiangyu KeKDD 2025 · 2 citations
- Let the Data Choose: Flexible and Diverse Anchor Graph Fusion for Scalable Multi-View ClusteringPei Zhang, Siwei Wang, Liang Li, Changwang Zhang et al.AAAI 2023 · 81 citations
