An approach to detect sub-community graph in n-community graphs using graph mining techniques

Finding of frequent sub-graphs is an important operation on graphs and it is defined as detection of all sub-graphs that appear frequently in a set of graphs. This paper proposes detection of frequent sub-community graph from n-set of community graph of villages; are useful for characterizing community graph sets, finding difference among groups of community graphs, classifying and clustering of community graphs, and building community graph indices leading to knowledge extraction. The given n-community graphs of villages and the sub-community graph, which is to be detected are first represented as adjacency matrices. Then the sub-community graph adjacency matrix is compared with the n-community graph's adjacency matrices sequentially. The paper concludes with analysis of the proposed algorithm using graph mining techniques with supportive example, satisfactory results and screenshots.

[1]  Ehud Gudes,et al.  Computing frequent graph patterns from semistructured data , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[2]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[3]  Christian Borgelt,et al.  Canonical Forms for Frequent Graph Mining , 2006, GfKl.

[4]  Jiawei Han,et al.  Local Learning for Mining Outlier Subgraphs from Network Datasets , 2014, SDM.

[5]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[6]  Lawrence B. Holder,et al.  Anomaly detection in data represented as graphs , 2007, Intell. Data Anal..

[7]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[8]  Bapuji Rao,et al.  An approach to merging of two community subgraphs to form a community graph using graph mining techniques , 2014, 2014 IEEE International Conference on Computational Intelligence and Computing Research.

[9]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[10]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[11]  Bapuji Rao,et al.  A new approach for detection of common communities in a social network using graph mining techniques , 2014, 2014 International Conference on High Performance Computing and Applications (ICHPCA).