Dynamic Pagerank Frequent Subgraph Mining by GraphX in the Distributed System

Graph Mining has been the most demanding research area for the last few decades in different fields, such as biological networks, the world wide web, mobile applications, sensors, online, social networks, etc. Frequent Subgraph Mining (FSM) plays a vital role in Graph Mining to exercise, study and generate interesting patterns from graph data. Basically, FSM techniques are classified into two types such as an apriori-based method, and a pattern growth-based method. This technique faces the problems such as the generation of the duplicate frequent subgraph, having no proper technique to rank during candidate generation, and how to map the threshold values. In this proposed system, a Dynamic PageRank GraphX- based Frequent Subgraph Mining (DPRGFSM) model that is able to extract interesting patterns from the distributed system by eliminating duplicates by ranking them to the proper level. In addition, we also use load balancing, pre-punning, and optimization techniques to improve its performance in both memory requirements and time complexity. The potency of methods defined in this paper is evaluated rigorously with different threshold values and comparative studies with different parameters with existing Spark- based Single Graph Mining (SSIGRAM) and A Ranked Frequent pattern Growth Framework (A- RAFF) and found drastic improvement with all four datasets. The proposed methodology is 1.6 times faster than the Spark-based Single Graph Mining (SSIGRAM) model and 50 times faster than the A Ranked Frequent pattern Growth Framework (A- RAFF) for recurrent subgraph extraction.