A Soft Affiliation Graph Model for Scalable Overlapping Community Detection
Abstract
We propose an overlapping community model based on the Affiliation Graph Model (AGM), that exhibits the pluralistic homophily property that the probability of a link between nodes increases with increasing number of shared communities. We take inspiration from the Mixed Membership Stochastic Blockmodel (MMSB), in proposing an edgewise community affiliation. This allows decoupling of community affiliations between nodes, opening the way to scalable inference. We show that our model corresponds to an AGM with soft community affiliations and develop a scalable algorithm based on a Stochastic Gradient Riemannian Langevin Dynamics (SGRLD) sampler. Empirical results show that the model can scale to network sizes that are beyond the capabilities of MCMC samplers of the standard AGM. We achieve comparable performance in terms of accuracy and run-time efficiency to scalable MMSB samplers.
Cite
Text
Laitonjam et al. "A Soft Affiliation Graph Model for Scalable Overlapping Community Detection." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2019. doi:10.1007/978-3-030-46150-8_30Markdown
[Laitonjam et al. "A Soft Affiliation Graph Model for Scalable Overlapping Community Detection." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2019.](https://mlanthology.org/ecmlpkdd/2019/laitonjam2019ecmlpkdd-soft/) doi:10.1007/978-3-030-46150-8_30BibTeX
@inproceedings{laitonjam2019ecmlpkdd-soft,
title = {{A Soft Affiliation Graph Model for Scalable Overlapping Community Detection}},
author = {Laitonjam, Nishma and Huáng, Weipéng and Hurley, Neil J.},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2019},
pages = {507-523},
doi = {10.1007/978-3-030-46150-8_30},
url = {https://mlanthology.org/ecmlpkdd/2019/laitonjam2019ecmlpkdd-soft/}
}