Mining Graph Patterns Efficiently via Randomized Summaries
暂无分享,去创建一个
Jiawei Han | Chen Chen | Cindy Xide Lin | Matt Fredrikson | Mihai Christodorescu | Xifeng Yan | Jiawei Han | Xifeng Yan | Matt Fredrikson | C. Lin | Mihai Christodorescu | Cheng Chen
[1] Sriram Raghavan,et al. Representing Web graphs , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).
[2] Ambuj K. Singh,et al. Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).
[3] George Karypis,et al. Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.
[4] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[5] Mohammad Al Hasan,et al. ORIGAMI: Mining Representative Orthogonal Graph Patterns , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).
[6] Jian Pei,et al. On mining cross-graph quasi-cliques , 2005, KDD '05.
[7] Jiong Yang,et al. SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.
[8] Neoklis Polyzotis,et al. XSKETCH synopses for XML data graphs , 2006, TODS.
[9] Philip S. Yu,et al. Mining significant graph patterns by leap search , 2008, SIGMOD Conference.
[10] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[11] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[12] Luc De Raedt,et al. Molecular feature mining in HIV data , 2001, KDD '01.
[13] Minos N. Garofalakis,et al. Approximate Query Processing: Taming the TeraBytes , 2001, VLDB.
[14] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[15] Lawrence B. Holder,et al. Substucture Discovery in the SUBDUE System , 1994, KDD Workshop.
[16] Nisheeth Shrivastava,et al. Graph summarization with bounded error , 2008, SIGMOD Conference.
[17] Christos Faloutsos,et al. Graph mining: Laws, generators, and algorithms , 2006, CSUR.
[18] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[19] George Karypis,et al. Finding Frequent Patterns in a Large Sparse Graph* , 2004, Data Mining and Knowledge Discovery.
[20] Mong-Li Lee,et al. NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs , 2006, KDD '06.
[21] Jignesh M. Patel,et al. Efficient aggregation for graph summarization , 2008, SIGMOD Conference.
[22] George Karypis,et al. Frequent Substructure-Based Approaches for Classifying Chemical Compounds , 2005, IEEE Trans. Knowl. Data Eng..
[23] Philip S. Yu,et al. Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.
[24] Mirek Riedewald,et al. Finding relevant patterns in bursty sequences , 2008, Proc. VLDB Endow..
[25] M. Tamer Özsu,et al. A succinct physical storage scheme for efficient evaluation of path queries in XML , 2004, Proceedings. 20th International Conference on Data Engineering.
[26] András A. Benczúr,et al. To randomize or not to randomize: space optimal summaries for hyperlink analysis , 2006, WWW '06.
[27] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[28] Philip S. Yu,et al. Graph OLAP: Towards Online Analytical Processing on Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[29] Takashi Washio,et al. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data , 2003, Machine Learning.