Journal
KNOWLEDGE AND INFORMATION SYSTEMS
Volume 25, Issue 2, Pages 345-369Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s10115-009-0251-x
Keywords
Social network analysis; Clustering; Graph partitioning
Funding
- Science Foundation Ireland [05/IN.1/I24, 08/SRC/I407]
- Enterprise Ireland [PC/2007/010]
- Science Foundation Ireland (SFI) [05/IN.1/I24] Funding Source: Science Foundation Ireland (SFI)
Ask authors/readers for more resources
The identification of cohesive communities is a key process in social network analysis. However, the algorithms that are effective for finding communities do not scale well to very large problems, as their time complexity is worse than linear in the number of edges in the graph. This is an important issue for those interested in applying social network analysis techniques to very large networks, such as networks of mobile phone subscribers. In this respect, the contributions of this paper are twofold. First, we demonstrate these scaling issues using a prominent community-finding algorithm as a case study. Then, we show that a two-stage process, whereby the network is first decomposed into manageable subnetworks using a multilevel graph partitioning procedure, is effective in finding communities in networks with more than 10(6) nodes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available