Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 633-642

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

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Frequent subgraph; Probabilistic semantics; Uncertain graph

Indexed keywords

APPROXIMATION QUALITY; FREQUENT SUBGRAPH MINING; FREQUENT SUBGRAPHS; GRAPH DATA; GRAPH DATABASE; HIGH QUALITY; MINING ALGORITHMS; NP-HARDNESS; PROBABILISTIC SEMANTICS; SUBGRAPHS; UNCERTAIN GRAPH;

DATA MINING; PROBABILITY; SEMANTICS;

APPROXIMATION ALGORITHMS;

EID: 77956193984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835885     Document Type: Conference Paper

References (15)

1. C. C. Aggarwal and H. Wang. Managing and Mining Graph Data. Springer, 2010.
2. 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.
3. M. A. Hasan and M. J. Zaki. Output space sampling for graph patterns. PVLDB, 2(1):730-741, 2009.
4. P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. DMKD, 17(1):3-23, 2008.
5. R. M. Karp and M. Luby. Monte-Carlo algorithms for enumeration and reliability problems. In FOCS, pages 56-64, 1983.
6. A. Kimmig and L. D. Raedt. Local query mining in a probabilistic prolog. In IJCAI, pages 1095-1100, 2009.
7. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng., 16(9):1038-1051, 2004.
8. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8(3):410-421, 1979.
9. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
10. G. Yang. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In KDD, pages 344-353, 2004.
11. Q. Zhang, F. Li, and K. Yi. Finding frequent items in probabilistic data. In SIGMOD, pages 819-832, 2008.
12. F. Zhu, X. Yan, J. Han, and P. S. Yu. gPrune: A constraint pushing framework for graph pattern mining. In PAKDD, pages 388-400, 2007.
13. Z. Zou, J. Li, H. Gao, and S. Zhang. Frequent subgraph pattern mining on uncertain graph data. In CIKM, pages 583-592, 2009.
14. Z. Zou, J. Li, H. Gao, and S. Zhang. Finding top-k maximal cliques in an uncertain graph. In ICDE, pages 649-652, 2010.
15. Z. Zou, J. Li, H. Gao, and S. Zhang. Mining frequent subgraph patterns from uncertain graph data. TKDE, preprint, 2010.