In graphs like social networks, Semantic Web and biological networks, every vertex has high information, which can be design by a set of tokens or elements. In this paper, we are studying about. Retrieving similarity set using sub graph approach, which gives subgraph that is structurally isomorphic to the query. Here we apply the apriori algorithm to find sub transaction set for actual transaction set in with each item get separated depending upon the category they are, which accomplish the frequent item set with its dynamic weight. In this we design a lightweight signature for both query vertices and data vertices. Structure-based pruning, which accomplishment the individual features of both (dynamic) weighted set similarity. We design an efficient algorithm to perform sub graph matching based on the dominating set of query graph.
IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.
