A Unified Semi-Supervised Community Detection Framework Using Latent Space Graph Regularization
The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Abstract
Community structure is one of the most important properties of complex networks and is a foundational concept in exploring and understanding networks. In real world, topology information alone is often inadequate to accurately find community structure due to its sparsity and noises. However, potential useful prior information can be obtained from domain knowledge in many applications. Thus, how to improve the community detection performance by combining network topology with prior information becomes an interesting and challenging problem. Previous efforts on utilizing such priors are either dedicated or insufficient. In this paper, we firstly present a unified interpretation to a group of existing community detection methods. And then based on this interpretation, we propose a unified semi-supervised framework to integrate network topology with prior information for community detection. If the prior information indicates that some nodes belong to the same community, we encode it by adding a graph regularization term to penalize the latent space dissimilarity of these nodes. This framework can be applied to many widely-used matrix-based community detection methods satisfying our interpretation, such as nonnegative matrix factorization, spectral clustering, and their variants. Extensive experiments on both synthetic and real networks show that the proposed framework significantly improves the accuracy of community detection, especially on networks with unclear structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557 · cited 1×
“In many different disciplines, data exist in the form of networks, such as social networks [1], [2], biological networks [1], [3], and technological networks [4].”
BackgroundCommunity structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 5×
“Different from NMF which obtains the formulation from the generative process of networks, SC is introduced to community detection by Newman [6], [29] to maximize modularity Q.”
BackgroundMethodInfluentialModularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256 · cited 5×
“It has been shown that networks have a structure of modules or communities which are subgraphs whose vertices are more tightly connected with each other than with vertices outside the subgraph [5], [6].”
BackgroundMethodInfluentialFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 2×
“In the past few years, a large number of community detection algorithms have been proposed and some of them have achieved good performance in many fields [7], [8], [24]–[27].”
BackgroundALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,968
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132 · cited 1×
“We make use of conjugate gradient method [42] to solve this linear equations system, because ∑ i wikI + λL is a symmetric positive definite matrix.”
MethodUncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373 · cited 2×
“In the past few years, a large number of community detection algorithms have been proposed and some of them have achieved good performance in many fields [7], [8], [24]–[27].”
BackgroundMethodFinding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761 · cited 3×
“Different from NMF which obtains the formulation from the generative process of networks, SC is introduced to community detection by Newman [6], [29] to maximize modularity Q.”
MethodAn Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051 · cited 3×
“The LFR networks benchmark [51] aims at addressing the above problems.”
BackgroundMethodInfluential
Cited by
A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning
Jin, D., Yu, Z., Jiao, P., Pan, S., He, D., Wu, J., Yu, P., & Zhang, W. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3104155 · Cited by 397
Self-citationPosition-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis
Luo, X., Yuan, Y., Chen, S., Zeng, N., & Wang, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3033324 · Cited by 264
Metadata
- Authors
- Yang, L., Cao, X., Jin, D., Wang, X., & Meng, D.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2015-11
- Volume
- 45
- Issue
- 11
- Pages
- 2585-2598
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W1966286510
- Cited by
- 197
- References
- 50
- FWCI
- 5.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.