Detecting Communities in Large Networks by Iterative Local Expansion
- Jiyang Chen
- Osmar R. Zaiane, University of Alberta (Database)
- Randy Goebel
Much structured data of scientific interest can be represented as networks, where sets of nodes or vertices are joined together in pairs by links or edges. Although these networks may belong to different research areas, there is one property that many of them do have in common: the network community structure, which means that there exists densely connected groups of vertices, with only sparser connections between groups. Identifying community structure in networks has attracted much research attention. However, most existing approaches require structure information of the graph in question to be completely accessible, which is impractical for some large networks, e.g., the World Wide Web (WWW). In this paper, we propose a community discovery algorithm for large networks that iteratively finds communities based on local information only. We compare our algorithm with previous global approaches to show its scalability. Experimental results on real world networks, such as the co-purchase network from Amazon, verify the feasibility and effectiveness of our approach.
Citation
J. Chen, O. Zaiane, R. Goebel. "Detecting Communities in Large Networks by Iterative Local Expansion". (ed: Ajith Abraham, Václav Snásel, Katarzyna Wegrzyn-Wolska), pp 105-112, June 2009.| Keywords: | |
| Category: | In Conference |
| Web Links: | IEEE |
BibTeX
@incollection{Chen+al:09,
author = {Jiyang Chen and Osmar R. Zaiane and Randy Goebel},
title = {Detecting Communities in Large Networks by Iterative Local
Expansion},
Editor = {Ajith Abraham, Václav Snásel, Katarzyna Wegrzyn-Wolska},
Pages = {105-112},
year = 2009,
}Last Updated: January 15, 2020Submitted by Sabina P
