cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining

[1]  Xing Xie,et al.  Network Motif Discovery: A GPU Approach , 2015, IEEE Transactions on Knowledge and Data Engineering.

[2]  Wang Wei,et al.  FSMBUS: A Frequent Subgraph Mining Algorithm in Single Large-Scale Graph Using Spark , 2015 .

[3]  Mohammad Al Hasan,et al.  An Iterative MapReduce Based Frequent Subgraph Mining Algorithm , 2013, IEEE Transactions on Knowledge and Data Engineering.

[4]  Wenqing Lin,et al.  Efficient techniques for subgraph mining and query processing , 2015 .

[5]  Xiaokui Xiao,et al.  Large-scale frequent subgraph mining in MapReduce , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[6]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[7]  Anthony K. H. Tung,et al.  Efficiently extracting frequent subgraphs using MapReduce , 2013, 2013 IEEE International Conference on Big Data.

[8]  Rajshekhar Sunderraman,et al.  An iterative MapReduce approach to frequent subgraph mining in biological datasets , 2012, BCB.

[9]  Christos Faloutsos,et al.  PEGASUS: mining peta-scale graphs , 2011, Knowledge and Information Systems.

[10]  Bin Wu,et al.  An Efficient Distributed Subgraph Mining Algorithm in Extreme Large Graphs , 2010, AICI.

[11]  Hui Xiong,et al.  Mining globally distributed frequent subgraphs in a single labeled graph , 2009, Data Knowl. Eng..

[12]  Stefan Kramer,et al.  Large-scale graph mining using backbone refinement classes , 2009, KDD.

[13]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[14]  Maria E. Orlowska,et al.  Graph Mining based on a Data Partitioning Approach , 2008, ADC.

[15]  George Karypis,et al.  A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[16]  Srinivasan Parthasarathy,et al.  Adaptive Parallel Graph Mining for CMP Architectures , 2006, Sixth International Conference on Data Mining (ICDM'06).

[17]  Thorsten Meinl,et al.  A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston , 2005, PKDD.

[18]  Joost N. Kok,et al.  A quickstart in frequent structure mining can make a difference , 2004, KDD.

[19]  Chen Wang,et al.  Scalable mining of large disk-based graph databases , 2004, KDD.

[20]  Jiong Yang,et al.  SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.

[21]  Wei Wang,et al.  Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.

[22]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[23]  Christian Borgelt,et al.  Mining molecular fragments: finding relevant substructures of molecules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[24]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[25]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[26]  Lawrence B. Holder,et al.  Approaches to Parallel Graph-Based Knowledge Discovery , 2001, J. Parallel Distributed Comput..

[27]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.