A Survey on Theoretical Advances of Community Detection in Networks
원문 초록
Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sciences, among others. Numerous approaches for community detection have been proposed in literature, from ad-hoc algorithms to systematic model-based approaches. The large number of available methods leads to a fundamental question: whether a certain method can provide consistent estimates of community labels. The stochastic blockmodel (SBM) and its variants provide a convenient framework for the study of such problems. This article is a survey on the recent theoretical advances of community detection. The authors review a number of community detection methods and their theoretical properties, including graph cut methods, profile likelihoods, the pseudo-likelihood method, the variational method, belief propagation, spectral clustering, and semidefinite relaxations of the SBM. The authors also briefly discuss other research topics in community detection such as robust community detection, community detection with nodal covariates and model selection, as well as suggest a few possible directions for future research.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Strongly Consistent Community Detection in Popularity Adjusted Block Models
Speaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm
MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph
Using deep learning for community discovery in social networks
High Quality, Scalable and Parallel Community Detectionfor Large Real Graphs
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.