Abstract
We describe models and efficient algorithms for detecting groups (communities) functioning in communication networks which attempt to hide their functionality - hidden groups. Our results reveal the properties of the background network activity that make detection of the hidden group easy, as well as those that make it difficult. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Baumes, J., Goldberg, M., Magdon-Ismail, M., & Wallace, W. A. (2004). Discovering hidden groups in communication networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3073, 378–389. https://doi.org/10.1007/978-3-540-25952-7_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
