Geometric Multi-Way Frequent Subgraph Mining Approach to a Single Large Database

In the present time, Graph Mining has become the most research-oriented field in the advance technologies for its importance in many areas, such as citation graphs, web data mining, chemical structures, protein interaction, social networks, etc. The rapid change in Graph Mining research work is fully dependent on the field of Graph Partitioning (GP) as well as Frequent Subgraph Mining (FSM). In this paper, we define Geometric Multi-Way Frequent Subgraph Mining (GMFSM) approach, which is based on Geometric Partition of a Single Large Graph Database with Frequent Subgraph Mining (FSM) approach that uses filtration technique to reduce number of candidate subgraphs. After partitioning the large graph database, we execute FSM algorithm simultaneously on each subparts which produce the desire result much faster (one-third to half) than existing algorithms. In addition, we use two-way partitioning algorithm recursively to obtain multi-way partition which drastically changes the performance of the algorithm.

[1]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[2]  Panos Kalnis,et al.  GraMi: Generalized Frequent Pattern Mining in a Single Large Graph , 2011 .

[3]  Jacob D. Furst,et al.  Predictive Data Mining for Lung Nodule Interpretation , 2007 .

[4]  Marc Sebban,et al.  A lower bound on the sample size needed to perform a significant frequent pattern mining task , 2009, Pattern Recognit. Lett..

[5]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[6]  Lu Wang,et al.  How to partition a billion-node graph , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[7]  Vipin Kumar,et al.  Analysis of Multilevel Graph Partitioning , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[8]  Sharma Chakravarthy,et al.  Modeling Relational Data as Graphs for Mining , 2009, COMAD.

[9]  Philip S. Yu,et al.  Fast Graph Pattern Matching , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[10]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[11]  Sabeur Aridhi,et al.  Density-based data partitioning strategy to approximate large-scale subgraph mining , 2012, Inf. Syst..

[12]  K. Lakshmi,et al.  FREQUENT SUBGRAPH MINING ALGORITHMS - A SURVEY AND FRAMEWORK FOR CLASSIFICATION , 2012, ICIT 2012.

[13]  Satish Rao,et al.  Geometry, flows, and graph-partitioning algorithms , 2008, Commun. ACM.

[14]  Christian Borgelt,et al.  Subgraph Support in a Single Large Graph , 2007 .

[15]  Alexandre Hollocou,et al.  A Streaming Algorithm for Graph Clustering , 2017, NIPS 2017.

[16]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[17]  Peter Sanders,et al.  Advanced Coarsening Schemes for Graph Partitioning , 2012, SEA.

[18]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[19]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[20]  Chris Walshaw,et al.  JOSTLE: multilevel graph partitioning software: an overview , 2007 .

[21]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[22]  Mohand Boughanem,et al.  Towards a graph-based user profile modeling for a session-based personalized search , 2009, Knowledge and Information Systems.

[23]  Nisheeth K. Vishnoi,et al.  On partitioning graphs via single commodity flows , 2008, STOC.

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

[25]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

[26]  Kevin J. Lang,et al.  An algorithm for improving graph partitions , 2008, SODA '08.

[27]  Ralf Diekmann,et al.  Quality matching and local improvement for multilevel graph-partitioning , 2000, Parallel Comput..

[28]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[29]  Charalampos E. Tsourakakis,et al.  FENNEL: streaming graph partitioning for massive scale graphs , 2014, WSDM.

[30]  Yixin Chen,et al.  An End-to-End Deep Learning Architecture for Graph Classification , 2018, AAAI.