SumGra: 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. This implementation is the one that has been used in : V. Ingalalli, D. Ienco and P. Poncelet. "Mining frequent subgraphs in multigraphs". In Information Sciences, Vol. 451-452, July 2018, pp. 50-66.
Complete list of metadatas

Browse

Present sur SoftwareHeritage - Identifier : swh:1:dir:0abf419bfe6e335edc1fe1626a167a373e0c195a  Browse

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02136558
Contributor : Pascal Poncelet <>
Submitted on : Wednesday, May 22, 2019 - 11:01:30 AM
Last modification on : Monday, September 2, 2019 - 2:46:16 PM

Collections

Citation

Vijay Ingalalli, Dino Ienco, Pascal Poncelet. SumGra: Mining Frequent Subgraphs in Multigraphs. 2019, ⟨swh:1:dir:0abf419bfe6e335edc1fe1626a167a373e0c195a⟩. ⟨lirmm-02136558⟩

Share

Metrics

Record views

40

Files downloads

3