A Parallel Algorithm for Frequent Subgraph Mining

This publication has 19 references indexed in Scilit:

• G-Tries: a data structure for storing and finding subgraphs
  Data Mining and Knowledge Discovery, 2013
• Accelerating frequent itemset mining on graphics processing units
  The Journal of Supercomputing, 2013
• Data mining of social networks represented as graphs
  Computer Science Review, 2013
• Extracting Correlated Patterns on Multicore Architectures
  Lecture Notes in Computer Science, 2013
• Mining Frequent Connected Subgraphs Reducing the Number of Candidates
  Lecture Notes in Computer Science, 2008
• Using a Hash-Based Method for Apriori-Based Graph Mining
  Lecture Notes in Computer Science, 2004
• LOGML: Log Markup Language for Web Usage Mining
  2002
• Approaches to Parallel Graph-Based Knowledge Discovery
  Journal of Parallel and Distributed Computing, 2001
• Mining frequent patterns without candidate generation
  ACM SIGMOD Record, 2000
• An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
  2000