The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
GEMSEC: graph embedding with self clustering
Open accessAbstract
Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC - a graph embedding algorithm which learns a clustering of the nodes simultaneously with computing their embedding. GEMSEC is a general extension of earlier work in the domain of sequence-based graph embedding. GEMSEC places nodes in an abstract feature space where the vertex features minimize the negative log-likelihood of preserving sampled vertex neighborhoods, and it incorporates known social network properties through a machine learning regularization. We present two new social network datasets and show that by simultaneously considering the embedding and clustering problems with respect to social properties, GEMSEC extracts high-quality clusters competitive with or superior to other community detection algorithms. In experiments, the method is found to be computationally efficient and robust to the choice of hyperparameters.
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416 · cited 3×
“In experimental evaluation we demonstrate that GEMSEC outperforms – in clustering quality – the state of the art neighborhood based [8], [9], multi-scale [16], [17] and community aware embedding methods [13], [14], [15].”
BackgroundMethodAn 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
Noise-contrastive estimation: A new estimation principle for unnormalized statistical models
Gutmann, M. U., & Hyvärinen, A. (2010) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 2,992
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
Structure and tie strengths in mobile communication networks
Onnela, J.-P., Saramäki, J., Hyvönen, J., Szabó, G., Lazer, D., Kaski, K., Kertész, J., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610245104 · Cited by 1,926
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801 · cited 2×
“learning tasks such as the labeling of the nodes, regression, edge prediction and graph visualization [9].”
MethodDeepWalk: Online Learning of Social Representations
Perozzi, B., Al‐Rfou, R., & Skiena, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.6652 · Cited by 1,107
Cooperative Game Theory Approaches for Network Partitioning
Avrachenkov, K. E., Kondratev, A. Y., & Mazalov, V. V. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-62389-4_49 · Cited by 1,073
Community Preserving Network Embedding
Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., & Yang, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10488 · Cited by 883
Finding overlapping communities in networks by label propagation
Gregory, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103018 · Cited by 806
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Distributed large-scale natural graph factorization
Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., & Smola, A. J. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488393 · Cited by 648
LINE: Large-Scale Information Network Embedding
Tang, J. G. (2024) · doi:10.57702/6e6l3h4g · Cited by 627
Community detection in Social Media: Performance and application considerations
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., & Spyridonos, P. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615
Learning Community Embedding with Community Detection and Node Embedding on Graphs
Cavallari, S., Zheng, V. W., Cai, H., Chang, K. C.-C., & Cambria, E. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132925 · Cited by 368
Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection
Ye, F., Chen, C., & Zheng, Z. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3271697 · Cited by 263
Representation Tradeoffs for Hyperbolic Embeddings
De, C., Gu, A., Ré, C., & Sala, F. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.03329 · Cited by 183
Don't Walk, Skip!: Online Learning of Multi-scale Network Embeddings
Perozzi, B., Kulkarni, V., Chen, H., & Skiena, S. (2017) · Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 · doi:10.1145/3110025.3110086 · Cited by 175
Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
Sarkar, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25878-7_34 · Cited by 168
Self-citationFast Sequence-Based Embedding with Diffusion Graphs
Rózemberczki, B., & Sarkar, R. (2018) · Springer proceedings in complexity · doi:10.1007/978-3-319-73198-8_9 · Cited by 79
Self-citationResilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
Zeng, W., Sarkar, R., Luo, F., Gu, X. D., & Gao, J. (2010) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2010.5461988 · Cited by 53
Self-citationvan Laarhoven, T., & Marchiori, E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34123-6_1 · Cited by 21
Bounded stretch geographic homotopic routing in sensor networks
Huang, K., Ni, C.-C., Sarkar, R., Gao, J., & Mitchell, J. S. B. (2014) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2014.6848027 · Cited by 10
Self-citation
Cited by
Multi-Scale attributed node embedding
Rozemberczki, B., Allen, C., & Sarkar, R. (2021) · Journal of Complex Networks · doi:10.1093/comnet/cnab014 · Cited by 640
Self-citationA Time-Dependent SIR Model for COVID-19 With Undetectable Infected Persons
Chen, Y.-C., Lu, P.-E., Chang, C.-S., & Liu, T.-H. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3024723 · Cited by 370
Adversarial Label-Flipping Attack and Defense for Graph Neural Networks
Zhang, M., Hu, L., Shi, C., & Wang, X. (2020) · 2020 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm50108.2020.00088 · Cited by 74
“To alleviate this issue, inspired by [20]–[22], we propose a community-preserving self-supervised-based defense framework, which can improve the robustness of GNNs against label-flipping attacks by fully exploiting community-level signals.”
Background
Metadata
- Authors
- Rozemberczki, B., Davies, R., Sarkar, R., & Sutton, C.
- Venue
- Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
- Publisher
- ACM
- Published
- 2019-08-27
- Pages
- 65-72
- OpenAlex
- W2976859544
- Cited by
- 272
- References
- 28
- FWCI
- 15.73
- Type
- conference paper
- Language
- en
- Open access
- green
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.