Mining frequent subgraphs in multigraphs

DOI10.1016/J.INS.2018.04.001MaRDI QIDQ2195360zbMATH OpenOpenAlexFDO

Authors Vijay Ingalalli, Dino Ienco, Pascal Poncelet

Publication date 8 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-01761235/file/InformationSciences2018Vijay.pdf

zbMATH Keywords

multigraphsgraph miningfrequent subgraphs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An efficient approach for mining frequent subgraphs
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Frequent mining of subgraph structures
• A general framework for mining frequent subgraphs from labeled graphs
• Mining graph patterns

Cites work

• A distributed approach for graph mining in massive networks
• An efficiently computable subgraph pattern support measure: counting independent observations
• Protein interaction networks. Computational analysis.

Cited in

(11)

• Three-objective subgraph mining using multiobjective evolutionary programming
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Algorithm for mining approximate frequent subgraphs in a single graph
• An efficient approach for mining frequent subgraphs
• Distributed discovery of frequent subgraphs of a network using MapReduce
• Efficient temporal core maintenance of massive graphs
• Mining weighted subgraphs in a single large graph
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• The Complexity of Mining Maximal Frequent Subgraphs
• Full Perfect Extension Pruning for Frequent Subgraph Mining
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach

Describes a project that uses

Uses Software

• gSpan

This page was built for publication: Mining frequent subgraphs in multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195360)