Efficient discovery of frequent subgraph patterns in uncertain graph databases

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages 355-366

  Papapetrou, Odysseas ^a   Ioannou, Ekaterini ^a   Skoutas, Dimitrios ^a  

^a L3S RESEARCH CENTER   (Germany)

Author keywords

Algorithms; Theory

Indexed keywords

COMPUTATION THEORY; PROBLEM SOLVING;

APRIORI; CANDIDATE PATTERNS; FREQUENT SUBGRAPHS; GRAPH DATABASE; PROPERTY; SUBGRAPH ISOMORPHISM; SUBGRAPHS; THEORY; UNCERTAIN GRAPHS; UNCERTAINTY;

GRAPH DATABASES;

EID: 79953907805     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1951365.1951408     Document Type: Conference Paper

References (32)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487-499, 1994.
2. S. Asthana, O. D. King, F. D. Gibbons, and F. P. Roth. Predicting protein complex membership using probabilistic network reliability. Genome Research, 14:1170-1175, 2004. (Pubitemid 38811553)
3. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
4. J. Cheng, Y. Ke, and W. Ng. Graphgen: A synthetic graph generator. http://www.cse.ust.hk/graphgen/, 2006.
5. J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In SIGMOD, pages 857-872, 2007. (Pubitemid 47630859)
6. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In 3rd IAPRTC15 Workshop on Graph-based Representations in Pattern Recognition, pages 149-159, 2001.
7. J. Ghosh, H. Q. Ngo, S. Yoon, and C. Qiao. On a routing problem within probabilistic graphs and its application to intermittently connected networks. In INFOCOM, pages 1721-1729, 2007. (Pubitemid 47334401)
8. E. Gudes, S. E. Shimony, and N. Vanetik. Discovering frequent graph patterns using disjoint paths. IEEE Trans. Knowl. Data Eng., 18(11):1441-1456, 2006.
9. H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In ICDE, page 38, 2006. (Pubitemid 44539830)
10. C. Helma, R. D. King, S. Kramer, and A. Srinivasan. The predictive toxicology evaluation challenge 2000-2001. Bioinformatics, 17(1):107-108, 2001. (Pubitemid 32178021)
11. P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov., 17(1):3-23, 2008.
12. M. Hua and J. Pei. Probabilistic path queries in road networks: traffic uncertainty aware path selection. In EDBT, pages 347-358, 2010.
13. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, 2003.
14. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: mining maximal frequent subgraphs from graph databases. In KDD, pages 581-586, 2004. (Pubitemid 40114974)
15. J. Huff and J. Haseman. Long-term chemical carcinogenesis experiments for identifying potential human cancer hazards. Environmental Health Perspectives, 96(3):23-31, 1991.
16. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13-23, 2000.
17. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
18. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng., 16(9):1038-1051, 2004.
19. D. Liben-Nowell and J. M. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556-559, 2003. (Pubitemid 40673595)
20. Y. Liu, J. Li, and H. Gao. Summarizing graph patterns. In ICDE, pages 903-912, 2008.
21. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004. (Pubitemid 40114985)
22. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-nearest neighbors in uncertain graphs. In PVLDB, 2010.
23. J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
24. L. G. Valiant. The complexity of computing the permanent. Theor. Comput. Sci., 8:189-201, 1979.
25. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi. Scalable mining of large disk-based graph databases. In KDD, pages 316-325, 2004. (Pubitemid 40114941)
26. T. Washio and H. Motoda. State of the art of graph-based data mining. SIGKDD Explor. Newsl., 5(1):59-68, 2003.
27. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
28. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
29. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In KDD, pages 286-295, 2003.
30. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
31. S. Zhang, J. Yang, and S. Li. Ring: An integrated method for frequent representative subgraph mining. In ICDM, pages 1082-1087, 2009.
32. Z. Zou, J. Li, H. Gao, and S. Zhang. Frequent subgraph pattern mining on uncertain graph data. In CIKM, pages 583-592, 2009.