A New Method Based on Graph Transformation for FAS Mining in Multi-graph Collections

Currently, there has been an increase in the use of frequent approximate subgraph FAS mining for different applications like graph classification. In graph classification tasks, FAS mining algorithms over graph collections have achieved good results, specially those algorithms that allow distortions between labels, keeping the graph topology. However, there are some applications where multi-graphs are used for data representation, but FAS miners have been designed to work only with simple-graphs. Therefore, in this paper, in order to deal with multi-graph structures, we propose a method based on graph transformations for FAS mining in multi-graph collections.

[1]  Annette Morales-González,et al.  Simple object recognition based on spatial relations and visual features represented using irregular pyramids , 2013, Multimedia Tools and Applications.

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

[3]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

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

[5]  Jianzhong Li,et al.  Finding top-k maximal cliques in an uncertain graph , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[6]  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.

[7]  Arend Rensink,et al.  Simulating Multigraph Transformations Using Simple Graphs , 2007, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[8]  J. S. Whalen,et al.  Finding maximal link disjoint paths in a multigraph , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[9]  Yngvi Björnsson,et al.  Improved Heuristics for Optimal Path-finding on Game Maps , 2006, AIIDE.

[10]  Lawrence B. Holder,et al.  Fuzzy Substructure Discovery , 1992, ML.

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

[12]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[13]  Jianzhong Li,et al.  Mining frequent subgraphs over uncertain graph databases under probabilistic semantics , 2012, The VLDB Journal.

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

[15]  Su-Shing Chen,et al.  Item sets based graph mining algorithm and application in genetic regulatory networks , 2006, 2006 IEEE International Conference on Granular Computing.

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