Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
暂无分享,去创建一个
[1] Feifei Li,et al. Finding frequent items in probabilistic data , 2008, SIGMOD Conference.
[2] Guizhen Yang,et al. The complexity of mining maximal frequent itemsets and maximal frequent patterns , 2004, KDD.
[3] Haixun Wang,et al. Efficient subgraph search over large uncertain graphs , 2011, Proc. VLDB Endow..
[4] Parag Agrawal,et al. Trio: a system for data, uncertainty, and lineage , 2006, VLDB.
[5] Luc De Raedt,et al. ProbLog: A Probabilistic Prolog and its Application in Link Discovery , 2007, IJCAI.
[6] Hans-Peter Kriegel,et al. Probabilistic frequent itemset mining in uncertain databases , 2009, KDD.
[7] Jiawei Han,et al. CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.
[8] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.
[9] Jianzhong Li,et al. Finding top-k maximal cliques in an uncertain graph , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[10] Jianzhong Li,et al. Frequent subgraph pattern mining on uncertain graph data , 2009, CIKM.
[11] Carson Kai-Sang Leung,et al. Mining of Frequent Itemsets from Streams of Uncertain Data , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[12] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[13] Charu C. Aggarwal,et al. Managing and Mining Graph Data , 2010, Managing and Mining Graph Data.
[14] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[15] Richard M. Karp,et al. Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[16] Ehud Gudes,et al. Discovering Frequent Graph Patterns Using Disjoint Paths , 2006, IEEE Transactions on Knowledge and Data Engineering.
[17] Lei Chen,et al. Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain Graphs , 2010, DASFAA.
[18] Jiong Yang,et al. SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.
[19] Philip S. Yu,et al. gPrune: A Constraint Pushing Framework for Graph Pattern Mining , 2007, PAKDD.
[20] David Poole,et al. Logic programming, abduction and probability , 1993, New Generation Computing.
[21] Eliezer L. Lozinskii,et al. The Good Old Davis-Putnam Procedure Helps Counting Models , 2011, J. Artif. Intell. Res..
[22] Joost N. Kok,et al. A quickstart in frequent structure mining can make a difference , 2004, KDD.
[23] George Karypis,et al. An efficient algorithm for discovering frequent subgraphs , 2004, IEEE Transactions on Knowledge and Data Engineering.
[24] Edward Hung,et al. Mining Frequent Itemsets from Uncertain Data , 2007, PAKDD.
[25] Hans-Peter Kriegel,et al. Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases , 2010, SSDBM.
[26] Christian Borgelt,et al. Mining molecular fragments: finding relevant substructures of molecules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[27] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[28] Mohammad Al Hasan,et al. Output Space Sampling for Graph Patterns , 2009, Proc. VLDB Endow..
[29] Jian Pei,et al. Probabilistic path queries in road networks: traffic uncertainty aware path selection , 2010, EDBT '10.
[30] Dan Olteanu,et al. Approximate confidence computation in probabilistic databases , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[31] Wei Wang,et al. Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.
[32] George Kollios,et al. k-nearest neighbors in uncertain graphs , 2010, Proc. VLDB Endow..
[33] Ben Kao,et al. A Decremental Approach for Mining Frequent Itemsets from Uncertain Data , 2008, PAKDD.
[34] Reynold Cheng,et al. Mining uncertain data with probabilistic guarantees , 2010, KDD.
[35] Michael Luby,et al. On deterministic approximation of DNF , 2005, Algorithmica.
[36] Graham Cormode,et al. Sketching probabilistic data streams , 2007, SIGMOD '07.
[37] Dimitrios Skoutas,et al. Efficient discovery of frequent subgraph patterns in uncertain graph databases , 2011, EDBT/ICDT '11.
[38] Jianzhong Li,et al. Mining Frequent Subgraph Patterns from Uncertain Graph Data , 2010, IEEE Transactions on Knowledge and Data Engineering.
[39] Dan Olteanu,et al. Conditioning probabilistic databases , 2008, Proc. VLDB Endow..
[40] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[41] Luc De Raedt,et al. Local Query Mining in a Probabilistic Prolog , 2009, IJCAI.
[42] Luca Trevisan,et al. A Note on Approximate Counting for k-DNF , 2004, APPROX-RANDOM.
[43] ZhangShuo,et al. Mining Frequent Subgraph Patterns from Uncertain Graph Data , 2010 .
[44] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[45] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[46] Hannu Toivonen,et al. Finding reliable subgraphs from large probabilistic graphs , 2008, Data Mining and Knowledge Discovery.