Monkey: Approximate Graph Mining Based on Spanning Trees
Shijie Zhang, Jiong Yang, VenuMadhav Cheedella · 2007
In the recent past, many exact graph mining algorithms have been developed to find frequent patterns in a graph database. However, many networks or graphs generated from biological data and other applications may be incomplete or inaccurate. Hence, it is necessary to design approximate graph mining techniques. In this paper, we will study the problem of approximate graph mining and propose an optimized solution which uses frequent trees and a spanning tree based pre-verification check in the mining process.