Multi-view Attributed Graph Clustering
Top Cited Papers
- 6 August 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Abstract
Multi-view graph clustering has been intensively investigated during the past years. However, existing methods are still limited in two main aspects. On the one hand, most of them can not deal with data that have both attributes and graphs. Nowadays, multi-view attributed graph data are ubiquitous and the need for effective clustering methods is growing. On the other hand, many state-of-the-art algorithms are either shallow or deep models. Shallow methods may seriously restrict their capacity for modeling complex data, while deep approaches often involve large number of parameters and are expensive to train in terms of running time and space needed. In this paper, we propose a novel multi-view attributed graph clustering (MAGC) framework, which exploits both node attributes and graphs. Our novelty lies in three aspects. First, instead of deep neural networks, we apply a graph filtering technique to achieve a smooth node representation. Second, the original graph could be noisy or incomplete and is not directly applicable, thus we learn a consensus graph from data by considering the heterogeneous views. Third, high-order relations are explored in a flexible way by designing a new regularizer. Extensive experiments demonstrate the superiority of our method in terms of effectiveness and efficiency.Keywords
Funding Information
- National Natural Science Foundation of China (61806045)
This publication has 32 references indexed in Scilit:
- Drug Similarity Integration Through Attentive Multi-view Graph Auto-Encoders2018
- An Attention-based Collaboration Framework for Multi-View Network Representation Learning2017
- Principled Multilayer Network Embedding2017
- Self-weighted Multiview Clustering with Multiple Graphs2017
- Structural Deep Network Embedding2016
- GraRep2015
- LINE2015
- DeepWalk2014
- Robust and Efficient Subspace Segmentation via Least Squares Regression2012
- Graph clusteringComputer Science Review, 2007