|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 146 - Number 11
|Year of Publication: 2016
|Authors: D. Kavitha, V. Kamakshi Prasad, J. V. R. Murthy
D. Kavitha, V. Kamakshi Prasad, J. V. R. Murthy . Finding Frequent Subgraphs in a Single Graph based on Symmetry. International Journal of Computer Applications. 146, 11 ( Jul 2016), 5-8. DOI=10.5120/ijca2016910895
Mining frequent subgraphs is a basic activity that plays an important role in mining graph data. In this paper an algorithm is proposed to find frequent subgraphs in a single large graph that has applications such as protein interactions, social networks, web interactions. One of the key operations required by any frequent subgraph discovery algorithm is to perform graph isomorphism. The proposed algorithm offers mining frequent subgraphs by avoiding the subgraph isomorphism problem through exploiting the symmetry properties present in the given graph.