Mining Frequent Subgraphs in Multigraphs

Vijay Ingalalli 1, 2 Dino Ienco 2, 1 Pascal Poncelet 1
1 ADVANSE - ADVanced Analytics for data SciencE
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : For more than a decade, extracting frequent patterns from single large graphs has been one of the research focuses. However, in this era of data eruption, rich and complex data is being generated at an unprecedented rate. This complex data can be represented as a multigraph structure-a generic and rich graph representation. In this paper, we propose a novel frequent subgraph mining approach MuGraM that can be applied to multigraphs. MuGraM is a generic frequent subgraph mining algorithm that discovers frequent multigraph patterns. MuGraM eciently performs the task of subgraph matching, which is crucial for support measure, and further leverages several optimization techniques for swift discovery of frequent subgraphs. Our experiments reveal two things: MuGraM discovers multigraph patterns, where other existing approaches are unable to do so; MuGraM, when applied to simple graphs, outperforms the state of the art approaches by at least one order of magnitude.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01761235
Contributor : Pascal Poncelet <>
Submitted on : Sunday, April 8, 2018 - 3:57:40 PM
Last modification on : Thursday, April 4, 2019 - 7:04:05 PM

File

InformationSciences2018Vijay.p...
Files produced by the author(s)

Identifiers

Citation

Vijay Ingalalli, Dino Ienco, Pascal Poncelet. Mining Frequent Subgraphs in Multigraphs. Information Sciences, Elsevier, 2018, 451-452, pp.50-66. ⟨10.1016/j.ins.2018.04.001⟩. ⟨lirmm-01761235⟩

Share

Metrics

Record views

413

Files downloads

255