A Cummulative Study on Sub Graph Matching(Survey Paper)

Abstract

Popularity of Social portals have connected user under similar domain sharing similarity in taste and view.
Analysis of this complex relation to find similar groups has been active area of research in graph based search.
Numerous research works on sub graph matching methodology have developed to identify similar users. Although major
research issue is hard rules of similarity detection fail to yield better results. This research manuscript presents sub
graph matching technique to recognize user relatedness based on pattern recognition of query. Pearson relation, pattern
analysis of frequent items and better reduction techniques enhance system performance. Recursive review on fifteen
articles has been done to find out research analysis question and proposed system is based on techniques to solve each
and every issue. Comparative examination presented.