Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3625403.3625407acmotherconferencesArticle/Chapter ViewAbstractPublication PagesadmitConference Proceedingsconference-collections
research-article
Public Access

Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection

Published: 17 November 2023 Publication History

Abstract

In this paper, we introduce a novel and computationally efficient method for vertex embedding, community detection, and community size determination. Our approach leverages a normalized one-hot graph encoder and a rank-based cluster size measure. Through extensive simulations, we demonstrate the excellent numerical performance of our proposed graph encoder ensemble algorithm.

References

[1]
Emmanuel Abbe. 2018. Community Detection and Stochastic Block Models: Recent Developments. Journal of Machine Learning Research 18, 177 (2018), 1–86.
[2]
V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 10008 (2008), 6.
[3]
L. Breiman. 2001. Random Forests. Machine Learning 4, 1 (October 2001), 5–32.
[4]
David L. Davies and Donald W. Bouldin. 1989. A Cluster Separation Measure. IEEE Transactions on Pattern Analysis and Machine Intelligence 1, 2 (1989), 224–227.
[5]
Edward W. Forgy. 1965. Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21, 3 (1965), 768–769.
[6]
Santo Fortunato. 2010. Community detection in graphs. Physics Reports 486, 3–5 (2010), 75–174. https://doi.org/10.1016/j.physrep.2009.11.002 arXiv:arXiv:0906.0612
[7]
Chao Gao, Zongming Ma, Anderson Y. Zhang, and Harrison H. Zhou. 2018. Community detection in degree-corrected block models. Annals of Statistics 46, 5 (2018), 2153–2185.
[8]
M. Girvan and M. E. J. Newman. 2002. Community Structure in Social and Biological Networks. Proceedings of National Academy of Science 99, 12 (2002), 7821–7826.
[9]
P. Holland, K. Laskey, and S. Leinhardt. 1983. Stochastic Blockmodels: First Steps. Social Networks 5, 2 (1983), 109–137.
[10]
B. Karrer and M. E. J. Newman. 2011. Stochastic blockmodels and community structure in networks. Physical Review E 83 (2011), 016107.
[11]
Stuart P. Lloyd. 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 2 (1982), 129–137.
[12]
R. Maclin and D. Opitz. 1999. Popular Ensemble Methods: An Empirical Study. Journal Of Artificial Intelligence Research 11 (1999), 169–198.
[13]
M. E. J. Newman. 2004. Detecting community structure in networks. European Physical Journal B 38, 2 (2004), 321–330. https://doi.org/10.1140/epjb/e2004-00124-y
[14]
W. M. Rand. 1971. Objective criteria for the evaluation of clustering methods. J. Amer. Statist. Assoc. 66, 336 (1971), 846–850.
[15]
K. Rohe, S. Chatterjee, and B. Yu. 2011. Spectral Clustering and the High-Dimensional Stochastic Blockmodel. Annals of Statistics 39, 4 (2011), 1878–1915.
[16]
Peter J. Rousseeuw. 1987. Silhouettes: a Graphical Aid to the Interpretation and Validation of Cluster Analysis. Computational and Applied Mathematics 20 (1987), 53–65.
[17]
C. Shen, J. Larson, H. Trinh, X. Qin, Y. Park, and C. E. Priebe. 2023. Discovering Communication Pattern Shifts in Large-Scale Networks using Encoder Embedding and Vertex Dynamics. https://arxiv.org/abs/2305.02381 (2023).
[18]
C. Shen, C. E. Priebe, J. Larson, and H. Trinh. 2023. Synergistic Graph Fusion via Encoder Embedding. https://arxiv.org/abs/2303.18051 (2023).
[19]
C. Shen, Q. Wang, and C. E. Priebe. 2023. One-Hot Graph Encoder Embedding. IEEE Transactions on Pattern Analysis and Machine Intelligence 45, 6 (2023), 7933 – 7938.
[20]
T. Snijders and K. Nowicki. 1997. Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure. Journal of Classification 14, 1 (1997), 75–100.
[21]
D. Sussman, M. Tang, D. Fishkind, and C. Priebe. 2012. A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs. J. Amer. Statist. Assoc. 107, 499 (2012), 1119–1128.
[22]
V. A. Traag, L. Waltman, and N. J. van Eck. 2019. From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports 9 (2019), 5233.
[23]
Y. Zhao, E. Levina, and J. Zhu. 2012. Consistency of Community Detection in Networks under Degree-Corrected Stochastic Block Models. Annals of Statistics 40, 4 (2012), 2266–2292.

Cited By

View all
  • (2024)Discovering Communication Pattern Shifts in Large-Scale Labeled Networks Using Encoder Embedding and Vertex DynamicsIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.333760011:2(2100-2109)Online publication date: Mar-2024
  • (2024)Fast and Scalable Multi-Kernel Encoder ClassifierProceedings of the Future Technologies Conference (FTC) 2024, Volume 310.1007/978-3-031-73125-9_10(161-177)Online publication date: 8-Nov-2024
  • (2024)Efficient Graph Encoder Embedding for Large Sparse Graphs in PythonIntelligent Computing10.1007/978-3-031-62269-4_36(568-577)Online publication date: 21-Jun-2024

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ADMIT '23: Proceedings of the 2023 2nd International Conference on Algorithms, Data Mining, and Information Technology
September 2023
227 pages
ISBN:9798400707629
DOI:10.1145/3625403
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 November 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Cluster Size Determination
  2. Embedding Normalization
  3. Graph Embedding
  4. Vertex Clustering

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

Conference

ADMIT 2023

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)55
  • Downloads (Last 6 weeks)12
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Discovering Communication Pattern Shifts in Large-Scale Labeled Networks Using Encoder Embedding and Vertex DynamicsIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.333760011:2(2100-2109)Online publication date: Mar-2024
  • (2024)Fast and Scalable Multi-Kernel Encoder ClassifierProceedings of the Future Technologies Conference (FTC) 2024, Volume 310.1007/978-3-031-73125-9_10(161-177)Online publication date: 8-Nov-2024
  • (2024)Efficient Graph Encoder Embedding for Large Sparse Graphs in PythonIntelligent Computing10.1007/978-3-031-62269-4_36(568-577)Online publication date: 21-Jun-2024

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media