ABSTRACT

With the advancement in technology, we are surrounded with huge amount of data, which need to be processed in some manner for further processing. For this purpose, we may combine the Data Mining Techniques with the concepts of Graph Theory. Real world systems may be represented as Graphs. For example: Social Networks may be depicted as graph with the people as nodes and their relationships represented as links. Community Structure has been found as an important property of these systems. In simple words we can define community structure as a connected sub-graph which is tightly connected within the subgroups and weakly connected within the subgroups. Various algorithms have been proposed till now to identify and detect these community structures. In this paper we will provide the overview of some approaches which identify the overlapping communities i.e. communities that may belong to more than one subgroups.