Local Community Detection in Complex Networks

Visa enkel post
dc.contributor.authorYuksel, Ömer Salih
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:21:18Z
dc.date.available2019-07-03T13:21:18Z
dc.date.issued2014
dc.description.abstractCommunity 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.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/193957
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleLocal Community Detection in Complex Networks
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
193957.pdf
Storlek:
1.72 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen