A Study on Community Overlapping Detection Algorithms in Social Networks

Community detection is one of the most important research area wherein invention and growthof social networks. Community is a set of members densely connected within a group and sparely connectedwith the other groups. In social networks, the singular characteristic of communities is multi membership of anode resulting in overlapping communities. Another relevant feature of social networks is the possibility toevolve over time. In recent years, many researchers have worked on various methods that can efficientlyunveil overlapped structure on dynamic network. This paper reviews the previous studies done on theproblem of overlapping community detection algorithms. Moreover, some approaches for dynamic networkthat change from time to time are also described