A frequent subgraph mining algorithm on the MapReduce model
Abstract
In this paper, we present the gSpanMR algorithm, a frequent subgraph mining on the MapReduce programming model. The gSpanMR algorithm (gSpan MapReduce) was developed based on the results of encoding graphs using the DFS code in gSpan algorithm and FSM-H algorithm on the MapReduce model. gSpanMR algorithm has been installed and tested on computer clusters using Hadoop platform, which shows better execution time than FSM-H algorithm.