A Parallel Algorithm for Graph Transaction Based Frequent Subgraph Mining

Frequent subgraph patterns play an important role in feature mining for graph data. The problem of mining these patterns is defined as finding subgraphs that appear frequently according to a given frequency threshold. Usually, frequent subgraph mining (FSM) is conducted in graph transaction setting, in which graph database contains many small graphs. Since multicore processors are quite popular this day, many algorithms can be accelerated with multi-thread technique. This paper proposed a multi-thread frequent subgraph mining algorithm and achieved considerable acceleration in the experiments. In this paper, a parallel frequent subgraph mining algorithm named PTRGRAM (Parallel Transaction based Graph Mining) which can take full advantage of the multi-core performance of current processors was proposed. In the algorithm, the data synchronization between multiple threads is based on the producer-consumer model. In addition, to speed the support computing, the embedding node list is introduced for optimization. Finally, experimental performance evaluations were conducted with two graph datasets, demonstrating that the proposed algorithm outperforms the single-threaded gSpan and FFSM algorithm.

[1]  Frans Coenen,et al.  A survey of frequent subgraph mining algorithms , 2012, The Knowledge Engineering Review.

[2]  Sung-Eui Yoon,et al.  Discriminative subgraphs for discovering family photos , 2016, Computational Visual Media.

[3]  Hui Wang,et al.  A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark , 2018 .

[4]  Keith C. C. Chan,et al.  MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs , 2018, IEEE Transactions on Cybernetics.

[5]  Wilfred Ng,et al.  Fg-index: towards verification-free query processing on graph databases , 2007, SIGMOD '07.

[6]  Panos Kalnis,et al.  GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph , 2014, Proc. VLDB Endow..

[7]  Yang Zhang,et al.  Implementing and Testing Producer-Consumer Problem Using Aspect-Oriented Programming , 2009, 2009 Fifth International Conference on Information Assurance and Security.

[8]  Chuntao Jiang,et al.  Frequent subgraph mining algorithms on weighted graphs , 2011 .

[9]  Huajun Chen,et al.  MapReduce-Based Pattern Finding Algorithm Applied in Motif Detection for Prescription Compatibility Network , 2009, APPT.

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

[11]  Yang Liu,et al.  Relationship Emergence Prediction in Heterogeneous Networks through Dynamic Frequent Subgraph Mining , 2014, CIKM.

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

[13]  Vitali Herrera-Semenets,et al.  A novel rule generator for intrusion detection based on frequent subgraph mining , 2017 .

[14]  Charalampos E. Tsourakakis,et al.  HADI : Fast Diameter Estimation and Mining in Massive Graphs with Hadoop , 2008 .