Mining clique frequent approximate subgraphs from multi-graph collections

Recently, some algorithms have been reported for mining multi-graph Frequent Approximate Subgraphs (FASs). This kind of algorithm has a large applicability in social network analysis, image classification tasks and clustering, among others. However, all of them mine a large number of patterns. For this reason, some algorithms for mining a subset of FASs have been proposed. In this paper, we propose an efficient algorithm for mining a subset of FASs on multi-graph collections. Our proposed algorithm becomes an alternative for reducing the number of mined FASs by computing the clique FASs. It is important to highlight that, to the best of our knowledge; our proposal is the first algorithm for mining clique FASs on multi-graph collections. Our proposal is compared against other reported solutions and evaluated over several synthetic and real-world multi-graphs. In addition, we show the usefulness of the patterns mined by our proposal for image classification.

[1]  Wajdi Dhifli,et al.  MR-SimLab: Scalable subgraph selection with label similarity for big data , 2013, Inf. Syst..

[2]  Kamal Kant Bharadwaj,et al.  Identifying community structure in a multi‐relational network employing non‐negative tensor factorization and GA k‐means clustering , 2017, WIREs Data Mining Knowl. Discov..

[3]  Sylvie Sevestre,et al.  Graph Structuring of Skeleton Object for Its High-Level Exploitation , 2015, ICIAR.

[4]  Yong Qin,et al.  Modeling cascade dynamics of railway networks under inclement weather , 2015 .

[5]  José Francisco Martínez Trinidad,et al.  Mining Generalized Closed Patterns from Multi-graph Collections , 2017, CIARP.

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

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

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

[9]  Wei Wang,et al.  Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.

[10]  Dino Ienco,et al.  Do more views of a graph help? Community detection and clustering in multi-graphs , 2013, Proceedings of the 16th International Conference on Information Fusion.

[11]  Jalel Akaichi,et al.  A New Framework of Frequent Uncertain Subgraph Mining , 2018, KES.

[12]  Antonio F. Gómez-Skarmeta,et al.  Online Urban Mobility Detection Based on Velocity Features , 2015, DaWaK.

[13]  Dino Ienco,et al.  Mining frequent subgraphs in multigraphs , 2018, Inf. Sci..

[14]  Raymond Y. K. Lau,et al.  Big data analytics for security and criminal investigations , 2017, WIREs Data Mining Knowl. Discov..

[15]  Ravi Shankar Singh,et al.  Error-tolerant graph matching using node contraction , 2018, Pattern Recognit. Lett..

[16]  Mario Vento,et al.  Trends in graph-based representations for Pattern Recognition , 2020, Pattern Recognit. Lett..

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

[18]  Jiadong Ren,et al.  Uncertain maximal frequent subgraph mining algorithm based on adjacency matrix and weight , 2018, Int. J. Mach. Learn. Cybern..

[19]  Saeed Jalili,et al.  Multi-kernel one class link prediction in heterogeneous complex networks , 2018, Applied Intelligence.

[20]  H. Karimi,et al.  A time-dependent vehicle routing problem in multigraph with FIFO property , 2015 .

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

[22]  Xifeng Yan,et al.  CloSpan: Mining Closed Sequential Patterns in Large Datasets , 2003, SDM.

[23]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

[24]  Rinkle Rani,et al.  Ap-FSM: A parallel algorithm for approximate frequent subgraph mining using Pregel , 2018, Expert Syst. Appl..

[25]  S. V. S. Santhi,et al.  A Survey of Frequent Subgraph Mining algorithms for Uncertain Graph Data , 2015 .

[26]  Yll Haxhimusa,et al.  Vision pyramids that do not grow too high , 2005, Pattern Recognit. Lett..

[27]  José Francisco Martínez Trinidad,et al.  Multi-graph Frequent Approximate Subgraph Mining for Image Clustering , 2018, IWAIPR.

[28]  Haiquan Wang,et al.  An Interval Algebra-based Modeling and Routing Method in Bus Delay Tolerant Network , 2015, KSII Trans. Internet Inf. Syst..

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

[30]  Yufei Chen,et al.  A graph based superpixel generation algorithm , 2018, Applied Intelligence.

[31]  Yang Wang,et al.  Efficient Mining of Frequent Patterns on Uncertain Graphs , 2019, IEEE Transactions on Knowledge and Data Engineering.

[32]  Jesús Ariel Carrasco-Ochoa,et al.  Extension of Canonical Adjacency Matrices for Frequent Approximate Subgraph Mining on Multi-Graph Collections , 2017, Int. J. Pattern Recognit. Artif. Intell..

[33]  Jesús Ariel Carrasco-Ochoa,et al.  Extensions to AGraP Algorithm for Finding a Reduced Set of Inexact Graph Patterns , 2018, Int. J. Pattern Recognit. Artif. Intell..

[34]  José Francisco Martínez Trinidad,et al.  A New Method Based on Graph Transformation for FAS Mining in Multi-graph Collections , 2015, MCPR.

[35]  Hai Le Vu,et al.  Partitioning road networks using density peak graphs: Efficiency vs. accuracy , 2017, Inf. Syst..

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

[37]  José Francisco Martínez Trinidad,et al.  A new algorithm for approximate pattern mining in multi-graph collections , 2016, Knowl. Based Syst..

[38]  Amita Jain,et al.  Semi Supervised Graph Based Keyword Extraction Using Lexical Chains and Centrality Measures , 2018, Computación y Sistemas.

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