SumGra: Mining Frequent Subgraphs in Multigraphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Software Year : 2019

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.
118 View
5 Download


Gmail Mastodon Facebook X LinkedIn More