Weighted MUSE for Frequent Sub-Graph Pattern Finding in Uncertain DBLP Data

@article{Jamil2011WeightedMF,
  title={Weighted MUSE for Frequent Sub-Graph Pattern Finding in Uncertain DBLP Data},
  author={Shawana Jamil and Azam Khan and Zahid Halim and Abdul Rauf Baig},
  journal={2011 International Conference on Internet Technology and Applications},
  year={2011},
  pages={1-6}
}
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… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Discovering frequent subgraph over uncertain graph database under probabilistic sementics

  • Z. Zou, J. Li, H. Gao, S. Zhang
  • The 16th ACM SIGKDD Conference on Knowledge…
  • 2010
Highly Influential
5 Excerpts

KNN in uncertain graphs

  • M. Potamias, F. Bonchi, A. Gionis, G. Kollios
  • In Proceedings of the VLDB Endowment, 36th…
  • 2010
2 Excerpts

Similar Papers

Loading similar papers…