Extensions to AGraP Algorithm for Finding a Reduced Set of Inexact Graph Patterns

Most algorithms to mine graph patterns, during the searching process, require a pattern to be identical to its occurrences, relying on the graph isomorphism problem. However, in recent years, there has been interest in the case in which it is acceptable to have some differences between a pattern and its occurrences, whether these differences are in labels or in structure. Allowing some differences and using inexact matching to measure the similarity between graphs lead to the discovery of new patterns, but some important challenges, such as the increment on the number of found patterns, make the post-mining analysis harder. In this work we focus on two extensions of the AGraP algorithm, which mines inexact patterns, addressing the issue of reducing the output pattern set while trying to retain the useful information gained through the use of inexact matching. First, exploring a traditional approach, we propose the CloseAFG algorithm that focuses on closed patterns. Then, we propose the IntAFG algorithm to...

[1]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[2]  George Karypis,et al.  GREW - a scalable frequent subgraph discovery algorithm , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[3]  Jintao Zhang,et al.  An efficient graph-mining method for complicated and noisy data with real-world applications , 2011, Knowledge and Information Systems.

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

[5]  Cláudia Antunes,et al.  Constrained pattern mining in the new era , 2015, Knowledge and Information Systems.

[6]  Kamalakar Karlapalem,et al.  MARGIN: Maximal Frequent Subgraph Mining , 2006, ICDM.

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

[8]  Mohammad Al Hasan,et al.  ORIGAMI: Mining Representative Orthogonal Graph Patterns , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[9]  Abraham Kandel,et al.  Classification Of Web Documents Using Graph Matching , 2004, Int. J. Pattern Recognit. Artif. Intell..

[10]  José Francisco Martínez Trinidad,et al.  Mining maximal frequent patterns in a single graph using inexact matching , 2014, Knowl. Based Syst..

[11]  George Karypis,et al.  Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.

[12]  José Francisco Martínez Trinidad,et al.  AGraP: an algorithm for mining frequent patterns in a single graph using inexact matching , 2014, Knowledge and Information Systems.

[13]  Xue Wang,et al.  On extending extreme learning machine to non-redundant synergy pattern based graph classification , 2015, Neurocomputing.

[14]  José Francisco Martínez Trinidad,et al.  New Penalty Scheme for Optimal Subsequence Bijection , 2013, CIARP.

[15]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Tijl De Bie,et al.  Interesting pattern mining in multi-relational data , 2013, Data Mining and Knowledge Discovery.

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

[18]  José Francisco Martínez Trinidad,et al.  Graph Clustering via Inexact Patterns , 2014, CIARP.

[19]  Jiawei Han,et al.  gApprox: Mining Frequent Approximate Patterns from a Massive Network , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[20]  Tatsuya Akutsu,et al.  Graph Kernels for Molecular Structure-Activity Relationship Analysis with Support Vector Machines , 2005, J. Chem. Inf. Model..

[21]  Fengchun Liu,et al.  Algorithm Research of Top-Down Mining Maximal Frequent SubGraph Based on Tree Structure , 2011 .

[22]  Howard J. Hamilton,et al.  Interestingness measures for data mining: A survey , 2006, CSUR.

[23]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[24]  Yongtang Shi,et al.  Fifty years of graph matching, network alignment and network comparison , 2016, Inf. Sci..

[25]  José Eladio Medina-Pagola,et al.  Frequent approximate subgraphs as features for graph-based image classification , 2012, Knowl. Based Syst..

[26]  Jiong Yang,et al.  SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.

[27]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[28]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[29]  Mario Vento,et al.  Graph Matching and Learning in Pattern Recognition in the Last 10 Years , 2014, Int. J. Pattern Recognit. Artif. Intell..

[30]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.