Multiple Local Community Detection
ACM SIGMETRICS Performance Evaluation Review · 20.03.2018 · 45 (3) · 76-83
DOI: 10.1145/3199524.3199537 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGMETRICS Performance Evaluation Review, online erschienen am 20.03.2018. Verfasst von Alexandre Hollocou und 2 weiteren Autor:innen. Die Arbeit wurde bisher 37-mal zitiert (Crossref) und nennt 34 Literaturangaben.
Abstract (Originalsprache)
Community detection is a classical problem in the field of graph mining. We are interested in local community detection where the objective is the recover the communities containing some given set of nodes, called the seed set. While existing approaches typically recover only one community around the seed set, most nodes belong to multiple communities in practice. In this paper, we introduce a new algorithm for detecting multiple local communities, possibly overlapping, by expanding the initial seed set. The new nodes are selected by some local clustering of the graph embedded in a vector space of low dimension. We validate our approach on real graphs, and show that it provides more information than existing algorithms to recover the complex graph structure that appears locally.
Zitieren
APA
Hollocou, A., Bonald, T., & Lelarge, M. (2018). Multiple Local Community Detection. ACM SIGMETRICS Performance Evaluation Review, 45(3), 76-83. https://doi.org/10.1145/3199524.3199537
Vancouver
Hollocou A, Bonald T, Lelarge M. Multiple Local Community Detection. ACM SIGMETRICS Performance Evaluation Review. 2018;45(3):76-83. doi:10.1145/3199524.3199537
BibTeX
@article{Hollocou2018,
author = {Hollocou, Alexandre and Bonald, Thomas and Lelarge, Marc},
title = {Multiple Local Community Detection},
journal = {ACM SIGMETRICS Performance Evaluation Review},
year = {2018},
volume = {45},
number = {3},
pages = {76--83},
doi = {10.1145/3199524.3199537}
}
EUVIMED