Disjoint Clusters Comparison of Overlapping Community Membership Detection

Abstract

The online social media is the great area of research which is explored by the researchers now days. There are number of areas in which overlapping commwunity detection works. In this paper comparison of various algorithms used to detect the overlapping will be made. The disjoint clusters can be identified by the use of algorithm. The framework for evaluating various algorithms will be described which will help disclosing the person’s membership in multiple clusters. The cluster will be collection of number of distinct users belonging to only one group. This paper evaluates the algorithms which are used for overlapping community membership detection.