Abstract

Community detection in attributed graph is of great application value and many related methods have been continually presented. However, existing methods for community detection in attributed graph still cannot well solve three key problems simultaneously: link information and attribute information fusion, prior information integration and overlapping community detection. Aiming at these problems, in this paper we devise a semi-supervised overlapping community detection method named SSGCAE which is based on graph neural networks. This method is composed of three modules: graph convolutional autoencoder (GCAE), semi-supervision and modularity maximization, which are respectively utilized to fuse link information and attribute information, integrate prior information and detect overlapping communities. We treat GCAE as the backbone framework and train it by using the unified loss from these three modules. Through this way, these three modules are jointly correlated via the community membership representation, which is very beneficial to improve the overall performance. SSGCAE is comprehensively evaluated on synthetic and real attributed graphs, and experiment results show that it is very effective and outperforms state-of-the-art baseline approaches.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.