Article : A Review On Overlapping Community Detection Algorithms


A Review On Overlapping Community Detection Algorithms


G.T.Prabavathi, Dr. V. Thiagarasu

Community structure is an important feature of complex networks and social network communities refer to groups of individuals within which social interactions are intense and between which they are weak. Community detection algorithms answer a wide range of questions regarding the behavior and interaction patterns of people. Usually, communities in social network can overlap with each other. Detecting overlapping communities is very important to understand and analyze the structure of social network. Approaches to find overlapping nodes in complex networks are categorized based on group density, dynamic agents, fuzzy logic and local expansion and optimization. This paper reviews the characteristics and limitations of clique percolation techniques, fuzzy approach, label propagation algorithms and local expansion and optimization techniques.

to continue reading Full Article


Pay only for this article and continue reading the full article


Indian Member   40.00

Others Member   3.00





Submit Article

iJARS Group invites Genuine Research Papers on Modern/Advanced trends in various fields of study.

To submit an article

Click Here



Associate your Conference with us Click here

Suggest a New Conference Click here

Upcoming Conferences Click here