The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A model-based approach to attributed graph clustering
Abstract
Graph clustering, also known as community detection, is a long-standing problem in data mining. However, with the proliferation of rich attribute information available for objects in real-world graphs, how to leverage structural and attribute information for clustering attributed graphs becomes a new challenge. Most existing works take a distance-based approach. They proposed various distance measures to combine structural and attribute information. In this paper, we consider an alternative view and propose a model-based approach to attributed graph clustering. We develop a Bayesian probabilistic model for attributed graphs. The model provides a principled and natural framework for capturing both structural and attribute aspects of a graph, while avoiding the artificial design of a distance measure. Clustering with the proposed model can be transformed into a probabilistic inference problem, for which we devise an efficient variational algorithm. Experimental results on large real-world datasets demonstrate that our method significantly outperforms the state-of-art distance-based attributed graph clustering method.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
(1988) · Cited by 16,582
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
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Fast Random Walk with Restart and Its Applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.70 · Cited by 1,184
Graph clustering based on structural/attribute similarities
Zhou, Y., Cheng, H., & Yu, J. X. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687709 · Cited by 863
Self-citationClustering Large Attributed Graphs: An Efficient Incremental Approach
Zhou, Y., Cheng, H., & Yu, J. X. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.41 · Cited by 177
Self-citationClustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities
Cheng, H., Zhou, Y., & Yu, J. X. (2011) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1921632.1921638 · Cited by 159
Self-citationCommunity Detection in a Large Real-World Social Network
Steinhaeuser, K., & Chawla, N. V. (2008) · Social Computing, Behavioral Modeling, and Prediction · doi:10.1007/978-0-387-77672-9_19 · Cited by 130
Clustering based on random graph model embedding vertex features
Zanghi, H., Volant, S., & Ambroise, C. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.01.026 · Cited by 86
HCDF: A Hybrid Community Discovery Framework
Henderson, K. A., Eliassi‐Rad, T., Papadimitriou, S., & Faloutsos, C. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.66 · Cited by 62
Central Clustering of Attributed Graphs
Jain, B. J., & Wysotzki, F. (2004) · Machine Learning · doi:10.1023/b:mach.0000033119.52532.ce · Cited by 52
ACM Attributed Graph Clustering for Learning Classes of Images
Lozano, M. Á., & Escolano, F. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45028-9_22 · Cited by 20
Cited by
Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.167 · Cited by 575
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
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Effective community search for large attributed graphs
Fang, Y., Cheng, R., Luo, S., & Hu, J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2994509.2994538 · Cited by 317
Community detection in node-attributed social networks: A survey
Chunaev, P. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100286 · Cited by 300
Metadata
- Authors
- Xu, Z., Ke, Y., Wang, Y., Cheng, H., & Cheng, J.
- Venue
- Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2012-05-20
- Pages
- 505-516
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2111315907
- Cited by
- 332
- References
- 16
- FWCI
- 15.36
- Type
- conference paper
- 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.