Abstract
In this paper, we present an efficient algorithm for finding overlapping communities in social networks. Our algorithm does not rely on the contents of the messages and uses the communication graph only. The knowledge of the structure of the communities is important for the analysis of social behavior and evolution of the society as a whole, as well as its individual members. This knowledge can be helpful in discovering groups of actors that hide their communications, possibly for malicious reasons. Although the idea of using communication graphs for identifying clusters of actors is not new, most of the traditional approaches, with the exception of the work by Baumes et al, produce disjoint clusters of actors, de facto postulating that an actor is allowed to belong to at most one cluster. Our algorithm is significantly more efficient than the previous algorithm by Baumes et al; it also produces clusters of a comparable or better quality.
This research was partially supported by NSF grants 0324947 and 0346341.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baumes, J., Goldberg, M., Krishnamoorty, M., Magdon-Ismail, M., Preston, N.: Finding communities by clustering a graph into overlapping subgraphs. In: Proceedings of IADIS Applied Computing 2005, February 2005, pp. 97–104 (2005)
Baumes, J., Goldberg, M., Magdon-Ismail, M., Wallace, W.: Discovering hidden groups in communication networks. In: 2nd NSF/NIJ Symposium on Intelligence and Security Informatics (2004)
Berry, J., Goldberg, M.: Path optimization for graph partitioning problem. Discrete Applied Mathematics 90, 27–50 (1999)
Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: Battista, D., Zwick, U. (eds.). LNCS, vol. 568–579. Springer, Heidelberg (2003)
Drineas, P., Kannan, R., Frieze, A., Vempala, S., Vinay, V.: Clustering in large graphs and matrices. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, SODA (1999)
Flake, G.W., Tsioutsiouliklis, K., Tarjan, R.E.: Graph clustering techniques based on minimum cut trees. Technical report, NEC, Princeton, NJ (2002)
Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49, 291–307 (1970)
Newman, M.E.J.: The structure and function of complex networks. SIAM Reviews 45(2), 167–256 (2003)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. In: Stanford Digital Libraries Working Paper (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumes, J., Goldberg, M., Magdon-Ismail, M. (2005). Efficient Identification of Overlapping Communities. In: Kantor, P., et al. Intelligence and Security Informatics. ISI 2005. Lecture Notes in Computer Science, vol 3495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427995_3
Download citation
DOI: https://doi.org/10.1007/11427995_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25999-2
Online ISBN: 978-3-540-32063-0
eBook Packages: Computer ScienceComputer Science (R0)