A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Weighted MUSE for Frequent Sub-Graph Pattern Finding in Uncertain DBLP Data
2011
2011 International Conference on Internet Technology and Applications
Preserved Fulltext
Studies shows that finding frequent sub-graphs in uncertain graphs database is an NP complete problem. Finding the frequency at which these sub-graphs occur in uncertain graph database is also computationally expensive. This paper focus on investigation of mining frequent sub-graph patterns in DBLP uncertain graph data using an approximation based method. The frequent sub-graph pattern mining problem is formalized by using the expected support measure. Here n approximate mining algorithm based
doi:10.1109/itap.2011.6006415
fatcat:kglhmiqdcrabndrvuhgu5n2oha