Fast AGM algorithm and application to three-dimensional structure analysis
Ke Luo · Journal of Computer Applications · 2010
Apriori-based Graph Mining(AGM) algorithm is simple and it is based on recursion statistics.When graph data set is very large,due to sub-graph isomorphism problem,so many redundant sub-graphs would be generated while generating candidate sub-graphs,which increases computation time.In this paper,an improved method was proposed to reduce redundant sub-graph candidates by adding extra constraints and use three-dimensional coordinate to calculate the distance between each vertex of a graph,which was added to the edge label for handling three-dimensional graph structured data.In this paper,chemical compounds were analyzed by the improved algorithm to describe their three-dimensional chemical structure and correlation with physiological activity and the computation time on different conditions were examined.The experimental results prove that the improved algorithm cuts down the computation time with more edge labels and improves the efficiency.