Fast Community Detection based on Graph Autoencoder Reconstruction
With the rapid development of big data, how to efficiently and accurately discover tight community structures in large-scale networks for knowledge discovery has attracted more and more attention. In this paper, a community detection framework based on Graph AutoEncoder Reconstruction (noted as GAER) is proposed for the first time. GAER is a highly scalable framework which does not require any prior information. We decompose the graph autoencoder-based one-step encoding into the two-stage encoding framework to adapt to the real-world big data system by reducing complexity from the original O(N^2) to O(N). At the same time, based on the advantages of GAER support module plug-and-play configuration and incremental community detection, we further propose a peer awareness based module for real-time large graphs, which can realize the new nodes community detection at a faster speed, and accelerate model inference with the 6.15 times - 14.03 times speed. Finally, we apply the GAER on multiple real-world datasets, including some large-scale networks. The experimental result verified that GAER has achieved the superior performance on almost all networks.
Code (0)
등록된 구현이 없습니다.
Tasks
Community DetectionSimilar Papers 제목 키워드 기반
Modularity-Aware Graph Autoencoders for Joint Community Detection and Link Prediction
Graph autoencoders (GAE) and variational graph autoencoders (VGAE) emerged as powerful methods for link prediction. Their performances are less impressive on community detection problems where, according to recent and co…
Community DetectionLink PredictionPredictionVGAER: Graph Neural Network Reconstruction based Community Detection
Community detection is a fundamental and important issue in network science, but there are only a few community detection algorithms based on graph neural networks, among which unsupervised algorithms are almost blank. B…
Community DetectionDecoderGraph Neural NetworkCommunity detection in sparse time-evolving graphs with a dynamical Bethe-Hessian
This article considers the problem of community detection in sparse dynamical graphs in which the community structure evolves over time. A fast spectral algorithm based on an extension of the Bethe-Hessian matrix is prop…
Community DetectionStochastic Block ModelGRASPED: Graph Anomaly Detection using Autoencoder with Spectral Encoder and Decoder (Full Version)
Graph machine learning has been widely explored in various domains, such as community detection, transaction analysis, and recommendation systems. In these applications, anomaly detection plays an important role. Recentl…
Graph Anomaly DetectionRecommendation SystemsCommunity DetectionRODEO: Robust DE-aliasing autoencOder for Real-time Medical Image Reconstruction
In this work we address the problem of real-time dynamic medical MRI and X Ray CT image reconstruction from parsimonious samples Fourier frequency space for MRI and sinogram tomographic projections for CT. Today the de f…
compressed sensingDe-aliasingImage Reconstruction