Options
Community Finding in Large Social Networks Through Problem Decomposition
Date Issued
August 2008
Date Available
30T13:41:55Z July 2021
Abstract
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 report are two-fold. First we demonstrate these scaling issues using a prominent community-finding algorithm as a case study. We then show that a twostage 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 106 nodes.
Sponsorship
Enterprise Ireland
Science Foundation Ireland
Type of Material
Technical Report
Publisher
University College Dublin. School of Computer Science and Informatics
Series
UCD CSI Technical Reports
ucd-csi-2008-4
Copyright (Published Version)
2008 the Authors
Language
English
Status of Item
Not peer reviewed
This item is made available under a Creative Commons License
File(s)
Owning collection
Views
345
Acquisition Date
Dec 11, 2023
Dec 11, 2023
Downloads
101
Last Month
3
3
Acquisition Date
Dec 11, 2023
Dec 11, 2023