publication . Part of book or chapter of book . Other literature type . 2005

Efficient Identification of Overlapping Communities

Malik Magdon-Ismail; Jeffrey Baumes; Mark Goldberg;
Open Access
  • Published: 01 Jan 2005
  • Publisher: Springer Berlin Heidelberg
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 ...
Subjects
free text keywords: Graph, Disjoint sets, Cluster (physics), Cluster graph, De facto, Social analysis, Efficient algorithm, Social network, business.industry, business, Computer science, Artificial intelligence
Related Organizations
Download fromView all 2 versions
http://www.cs.rpi.edu/~goldber...
Part of book or chapter of book
Provider: UnpayWall
http://dx.doi.org/10.1007/1142...
Other literature type . 2005
Provider: Datacite
http://www.springerlink.com/in...
Part of book or chapter of book . 2010
Provider: Crossref
Any information missing or wrong?Report an Issue