Local Community Detection in Complex Networks

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/193957
Download file(s):
File Description SizeFormat 
193957.pdfFulltext1.76 MBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Local Community Detection in Complex Networks
Authors: Yuksel, Ömer Salih
Abstract: Community structure is an important aspect of network analysis, with a variety of reallife applications. Local community detection algorithms, which are relatively new in literature, provide the opportunity to analyze community structure in large networks without needing global information. We focus our work on a state-of-the-art algorithm developed by Yang and Leskovec and evaluate it on three di erent networks: Amazon, DBLP and Soundcloud. We highlight various similarities and di erences between the geometry and the sizes of real and annotated communities. The algorithm shows robustness to the seed node, which is also demonstrated by its rather high level of stability. By using two di erent methods of seed selection from the literature, we demonstrate further improvement on the quality of the communities returned by the algorithm. Finally, we try to detect reallife communities and show that the local algorithm is comparable to global algorithms in terms of accuracy.
Keywords: Data- och informationsvetenskap;Computer and Information Science
Issue Date: 2014
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/193957
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.