International Conference on Big Data · 2014 · 16 citations · 9 references
ComputingComputer ScienceHigh-performance ComputingAlgorithmsParallel AlgorithmsParallel ComputingGraph AlgorithmsGraph MiningGraph TheoryGraphics Processing Unit ArchitectureGraphics Processing Unit ComputingGraphics Processing UnitsGpu Parallel AlgorithmsGpu Programming ModelsGraph ProcessingParallel Graph AlgorithmsScalable Graph MiningSubgraph Extraction
Frequent graph mining is an important though computationally hard problem because it requires enumerating possibly an exponential number of candidate subgraph patterns, and checking their presence in a database of graphs. In this paper, we propose a novel approach for parallel graph mining on GPUs, which have emerged as a relatively cheap but powerful architecture for general purpose computing. However, the thread-model for GPUs is different from that of CPUs, which makes the parallelization of graph mining algorithms on GPUs a challenging task. We investigate the major challenges for GPU-based graph mining. We perform extensive experiments on several real-world and synthetic datasets, achieving speedups up to 9 over the sequential algorithm.
9
An Algorithm for Subgraph Isomorphism
J. R. Ullmann · Journal of the ACM · 1976 · 2.3K citations · Full text
gSpan: graph-based substructure pattern mining
Xifeng Yan, Jiawei Han · 2003 · 2K citations
M. Kuramochi, George Karypis · 2002 · 1.1K citations · Full text
Efficient mining of frequent subgraphs in the presence of isomorphism
Jun Huan, Wei Wang, Jan F. Prins · 2004 · 617 citations