Frequent subgraph pattern mining on uncertain graph data

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 583-592

  Zou, Zhaonian ^a   Li, Jianzhong ^a   Gao, Hong ^a   Zhang, Shuo ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Expected support; Subgraph pattern; Uncertain graph

Indexed keywords

EFFICIENT APPROXIMATION ALGORITHMS; ERROR TOLERANCE; FREQUENT SUBGRAPHS; GRAPH DATA; GRAPH DATABASE; MINING ALGORITHMS; PATTERN MINING; SUBGRAPH PATTERN; SUBGRAPHS;

DATA MINING; KNOWLEDGE MANAGEMENT;

APPROXIMATION ALGORITHMS;

EID: 74549169009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646028     Document Type: Conference Paper

References (30)

1. C. C. Aggarwal, Y. Li, J. Wang, and J. Wang. Frequent pattern mining with uncertain data. In KDD, pages 29-38, 2009.
2. S. Asthana, O. D. King, F. D. Gibbons, and F. P. Roth. Predicting protein complex membership using probabilistic network reliability. Genome Research, 14(6):1170-1175, 2004.
3. T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Züfle. Probabilistic frequent itemset mining in uncertain databases. In KDD, pages 119-128, 2009.
4. G. Cormode and A. McGregor. Approximation algorithms for clustering uncertain data. In PODS, pages 191-200, 2008.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
6. 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.
7. P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov., 17(1):3-23, 2008.
8. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, page 549, 2003.
9. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: mining maximal frequent subgraphs from graph databases. In KDD, pages 581-586, 2004.
10. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13-23, 2000.
11. R. M. Karp and M. Luby. Monte-carlo algorithms for enumeration and reliability problems. In FOCS, pages 56-64, 1983.
12. Y. Ke, J. Cheng, and W. Ng. Correlation search in graph databases. In KDD, pages 390-399, 2007.
13. M. Koyutürk, A. Grama, and W. Szpankowski. An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics, 20(Suppl. 1):i200-i207, 2004.
14. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
15. Y. Liu, J. Li, and H. Gao. Summarizing graph patterns. In ICDE, pages 903-912, 2008.
16. M. Luby and B. Velickovic. On deterministic approximation of dnf. In STOC, pages 430-438, 1991.
17. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.
18. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
19. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In KDD, pages 228-238, 2005.
20. S. Suthram, T. Shlomi, E. Ruppin, R. Sharan, and T. Ideker. A direct comparison of protein interaction confidence assignment schemes. BMC Bioinformatics, 7(1):360, 2006.
21. S. Tsang, B. Kao, K. Y. Yip, W.-S. Ho, and S. D. Lee. Decision trees for uncertain data. In ICDE, pages 441-444, 2009.
22. L. G. Valiant. The complexity of computing the permanent. Theor. Comput. Sci., 8:189-201, 1979.
23. N. Vanetik. Discovering frequent graph patterns using disjoint paths. TKDE, 18(11):1441-1456, 2006.
24. 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.
25. J. Wang, Z. Zeng, and L. Zhou. Clan: An algorithm for mining closed cliques from large dense graph databases. In ICDE, page 73, 2006.
26. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
27. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, page 721, 2002.
28. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In KDD, pages 286-295, 2003.
29. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Out-of-core coherent closed quasi-clique mining from large dense graph databases. TODS, 32(2):13, 2007.
30. Q. Zhang, F. Li, and K. Yi. Finding frequent items in probabilistic data. In SIGMOD, 2008.