An optimized approach for community detection and rankingReport as inadecuate

An optimized approach for community detection and ranking - Download this document for free, or read online. Document in PDF available to download.

Journal of Big Data

, 3:22

First Online: 10 November 2016Received: 28 August 2016Accepted: 03 November 2016


Community structures and relation patterns, and ranking them for social networks provide us with great knowledge about network. Such knowledge can be utilized for target marketing or grouping similar, yet distinct, nodes. The ever-growing variety of social networks necessitates detection of minute and scattered communities, which are important problems across different research fields including biology, social studies, physics, etc. Existing community detection algorithms such as fast and folding or modularity based are either incapable of finding graph anomalies or too slow and impractical for large graphs. The main contributions of this work are twofold: i we optimize the Attractor algorithm, speeding it up by a factor depending on complexity of the graph; i.e. the more complex a social graph is, the better result the algorithm will achieve, and ii we propose a community ranker algorithm for the first time. The former is achieved by amalgamating loops and incorporating breadth-first search BFS algorithm for edge alignments and to fill in the missing cache, preserving a constant of time equal to the number of edges in the graph. For the latter, we make the first attempt to enumerate how influential each community is in a given graph, ranking them based on their normalized impact factor.

KeywordsBetweenness Breadth-first search Community strength Complex networks Jaccard index Modularity  Download fulltext PDF

Author: Matin Pirouz - Justin Zhan - Shahab Tayeb



Related documents