Algorithm for Retrieval of Sub-community Graph from a Compressed Community Graph Using Graph Mining Techniques.

Community detection is the one of the most relevant and important topics in the field of graph mining, principally for its applications in number of domains such as social or biological networks analysis to transport systems. Different community detection algorithms have been proposed earlier. This paper discusses and proposes a new technique on particular community detection and its retrieval in social community graph. Community detection constitutes a significant role for analysis of a large community graph by enabling and selecting the desired community's graph. It tries to extract a sub-community graph from a very large community graph for analysis. This paper presents both a theoretical and experimental result in this direction with certain example. We have retrieved the sub-community graph from a compressed community graph in the context of graph mining techniques. Observation concludes that the proposed technique is simpler, easier and efficient in terms of complexities. [ABSTRACT FROM AUTHOR]