Detecting communities and their evolutions in dynamic social networks—a Bayesian approach
Open accessThe DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
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. S., & Faust, K. (1994) · Cited by 17,991
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 4×
“As state in (Newman and Girvan 2004), modularity measures how likely a network is generated due to the proposed community structure versus generated by a random process.”
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
(2006) · Springer eBooks · Cited by 8,123
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049 · cited 1×
“As a consequence, we appeal to the Gibbs sampling method (Geman and Geman 1984; Griffiths and Steyvers 2004) for the solutions.”
MethodChung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Latent Space Approaches to Social Network Analysis
Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502388618906 · Cited by 1,917
Quantifying social group evolution
Palla, G., Barabási, A.-L., & Vicsek, T. (2007) · Nature · doi:10.1038/nature05670 · Cited by 1,668
Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., & Wagner, D. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190689 · Cited by 1,242
Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and p
Wasserman, S., & Pattison, P. (1996) · Psychometrika · doi:10.1007/bf02294547 · Cited by 950
Markov chain Monte Carlo estimation of exponential random graph models
Snijders, T. A. B. (2002) · Journal of Social Structure · Cited by 869
Efficient identification of Web communities
Flake, G. W., Lawrence, S., & Giles, C. L. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347121 · Cited by 804
Semi-supervised learning with graphs
Zhu, X., Lafferty, J., & Rosenfeld, R. (2005) · Cited by 732
Chakrabarti, D., Kumar, R., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150467 · Cited by 661
On the bursty evolution of blogspace
Kumar, R., Novak, J., Raghavan, P., & Tomkins, A. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775233 · Cited by 553
GraphScope: parameter-free mining of large time-evolving graphs
Sun, J., Faloutsos, C., Papadimitriou, S., & Yu, P. S. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281266 · Cited by 532
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Mei, Q., & Zhai, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081895 · Cited by 524
A framework for community identification in dynamic social networks
Tantipathananandh, C., Berger-Wolf, T., & Kempe, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281269 · Cited by 443
Local Structure in Social Networks
Holland, P. W., & Leinhardt, S. (1976) · Sociological Methodology · doi:10.2307/270703 · Cited by 439
Dynamic social network analysis using latent space models
Sarkar, P., & Moore, A. W. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117459 · Cited by 422
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
Lin, Y.-R., Chi, Y., Zhu, S., Sundaram, H., & Tseng, B. L. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367590 · Cited by 407
Self-citationA Spectral Clustering Approach To Finding Communities in Graphs
White, S., & Smyth, P. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.25 · Cited by 404
Evolutionary spectral clustering by incorporating temporal smoothness
Chi, Y., Song, X., Zhou, D., Hino, K., & Tseng, B. L. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281212 · Cited by 375
Self-citationBayesian Approach to Network Modularity
Hofman, J. M., & Wiggins, C. H. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.258701 · Cited by 298
Analyzing communities and their evolutions in dynamic social networks
Lin, Y.-R., Chi, Y., Zhu, S., Sundaram, H., & Tseng, B. L. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1514888.1514891 · Cited by 296
Self-citationStatistical Analysis of Multiple Sociometric Relations
Fienberg, S. E., Meyer, M. M., & Wasserman, S. S. (1985) · Journal of the American Statistical Association · doi:10.1080/01621459.1985.10477129 · Cited by 289
Community evolution in dynamic multi-mode networks
Tang, L., Liu, H., Zhang, J., & Nazeri, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401972 · Cited by 245
A particle-and-density based evolutionary clustering method for dynamic networks
Kim, M.-S., & Han, J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687698 · Cited by 243
MetaFac: community discovery via relational hypergraph factorization
Lin, Y.-R., Sun, J., Castro, P., Konuru, R., Sundaram, H., & Kelliher, A. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557080 · Cited by 211
Ahmed, A., & Xing, E. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.20 · Cited by 167
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Asur, S., Parthasarathy, S., & Ucar, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281290 · Cited by 166
Finding Social Groups: A Meta-Analysis of the Southern Women Data
Freeman, L. C. (2003) · Cited by 123
Detecting Communities in Social Networks using Max-Min Modularity
Chen, J., Zai͏̈ane, O. R., & Goebel, R. G. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.84 · Cited by 107
Discovering Latent Classes in Relational Data
Kemp, C., Griffiths, T. L., & Tenenbaum, J. B. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 89
Extracting evolution of web communities from a series of web archives
Toyoda, M., & Kitsuregawa, M. (2003) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/900051.900059 · Cited by 87
Positional Estimation Within a Latent Space Model for Networks
Shortreed, S. M., Handcock, M. S., & Hoff, P. D. (2006) · Methodology · doi:10.1027/1614-2241.2.1.24 · Cited by 61
A Bayesian Approach Toward Finding Communities and Their Evolutions in Dynamic Social Networks
Yang, T., Chi, Y., Shenghuo Zhu, B., Gong, Y., & Jin, R. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.85 · Cited by 51
Self-citation
Cited by
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Community Discovery in Dynamic Networks: A Survey
Rossetti, G., & Cazabet, R. (2019) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 468
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
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabrys, B., & Musial, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 331
Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
Matias, C., & Miele, V. (2017) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12200 · Cited by 326
Metadata
- Authors
- Yang, T., Chi, Y., Zhu, S., Gong, Y., & Jin, R.
- Venue
- Machine Learning
- Published
- 2010-09-25
- Volume
- 82
- Issue
- 2
- Pages
- 157-189
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2168878667
- Cited by
- 318
- References
- 41
- FWCI
- 6.47
- Type
- journal article
- Language
- en
- Open access
- bronze
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.