Graph convolutional networks meet markov random fields: Semi-supervised community detection in attribute networks

159Citations
Citations of this article
102Readers
Mendeley users who have this article in their library.

Abstract

Community detection is a fundamental problem in network science with various applications. The problem has attracted much attention and many approaches have been proposed. Among the existing approaches are the latest methods based on Graph Convolutional Networks (GCN) and on statistical modeling of Markov Random Fields (MRF). Here, we propose to integrate the techniques of GCN and MRF to solve the problem of semi-supervised community detection in attributed networks with semantic information. Our new method takes advantage of salient features of GNN and MRF and exploits both network topology and node semantic information in a complete end-to-end deep network architecture. Our extensive experiments demonstrate the superior performance of the new method over state-of-the-art methods and its scalability on several large benchmark problems.

Cite

CITATION STYLE

APA

Jin, D., Liu, Z., Li, W., He, D., & Zhang, W. (2019). Graph convolutional networks meet markov random fields: Semi-supervised community detection in attribute networks. In 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 (pp. 152–159). AAAI Press. https://doi.org/10.1609/aaai.v33i01.3301152

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free