Mining Frequent Subgraphs in Multigraphs - INRAE - Institut national de recherche pour l’agriculture, l’alimentation et l’environnement Access content directly
Journal Articles Information Sciences Year : 2018

Mining Frequent Subgraphs in Multigraphs


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.
Fichier principal
Vignette du fichier
InformationSciences2018Vijay.pdf (1.55 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-01761235 , version 1 (08-04-2018)



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



Gmail Mastodon Facebook X LinkedIn More