Withdraw
Loading…
Scaling overlapping community detection algorithms
Chaugule, Amey
Content Files

Loading…
Download Files
Loading…
Download Counts (All Files)
Loading…
Edit File
Loading…
Permalink
https://hdl.handle.net/2142/50662
Description
- Title
- Scaling overlapping community detection algorithms
- Author(s)
- Chaugule, Amey
- Issue Date
- 2014-09-16
- Director of Research (if dissertation) or Advisor (if thesis)
- Polychronopoulos, Constantine D.
- Department of Study
- Electrical & Computer Eng
- Discipline
- Electrical & Computer Engr
- Degree Granting Institution
- University of Illinois at Urbana-Champaign
- Degree Name
- M.S.
- Degree Level
- Thesis
- Date of Ingest
- 2014-09-16T17:25:00Z
- Keyword(s)
- Network Communities
- Overlapping community detection
- Scalable Systems
- Distributed graph processing
- Abstract
- Community structure is observed in many real-world networks in fields ranging from social networking to biological networks. Over the last decade many approaches have been proposed to efficiently detect the underlying structure of communities in graphs with a greater degree of correctness. This specific area of graph mining is known as community detection. It is one of the most critical components of graph mining. It helps in understanding the underlying properties of the graph. While a lot of effort has been expended on detecting standard partitions in a graph, real world applications are complicated and they exhibit nodes belonging to multiple communities concurrently. Although many algorithms such as Clique Percolation Method, COPRA, etc., have been developed to detect overlapping communities in graphs, they rely on expensive and complicated optimization techniques and do not scale well to real world datasets containing millions of nodes and tens of millions of edges. In this thesis, we propose a vertex centric approach to the problem and we evaluate scalability of overlapping community detection algorithms when implemented using vertex centric graph processing frameworks such as GraphLab/GraphChi. In particular we implemented BigCLAM in GraphChi and were able to achieve speedups of up to 6.5x on large scale real world graphs, thus proving that our approach can give linear speedups on the same hardware settings.
- Graduation Semester
- 2014-08
- Permalink
- http://hdl.handle.net/2142/50662
- Copyright and License Information
- Copyright 2014 Amey S. Chaugule
Owning Collections
Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at IllinoisDissertations and Theses - Electrical and Computer Engineering
Dissertations and Theses in Electrical and Computer EngineeringManage Files
Loading…
Edit Collection Membership
Loading…
Edit Metadata
Loading…
Edit Properties
Loading…
Embargoes
Loading…