Bridge Bounding: A Local Approach for Efficient Community Discovery in Complex Networks

TitleBridge Bounding: A Local Approach for Efficient Community Discovery in Complex Networks
Publication TypeConference Paper
Year of Publication2009

The increasing importance of Web 2.0 applications duringthe last years has created significant interest in tools for analyzingand describing collective user activities and emergingphenomena within the Web. Network structures have beenwidely employed in this context for modeling users, web resourcesand relations between them. However, the amountof data produced by modern web systems results in networksthat are of unprecedented size and complexity, and are thushard to interpret. To this end, community detection methodsattempt to uncover natural groupings of web objects byanalyzing the topology of their containing network.There are numerous techniques adopting a global perspectiveto the community detection problem, i.e. they operateon the complete network structure, thus being computationallyexpensive and hard to apply in a streaming manner. Inorder to add a local perspective to the study of the problem,we present Bridge Bounding, a local methodology for communitydetection, which explores the local network topologyaround a seed node in order to identify edges that act asboundaries to the local community. The proposed methodcan be integrated in an efficient global community detectionscheme that compares favorably to the state of the art. As acase study, we apply the method to explore the topic structureof the LYCOS iQ collaborative question/answering applicationby detecting communities in the networks createdfrom the collective tagging activity of users.


auth logo

Location & Contact

Department of Informatics
Aristotle University of Thessaloniki
Thessaloniki GR-54124

t  | (+30) 2310 998415
e |