Skip to Main content Skip to Navigation
Conference papers

GraphMDL : sélection de motifs de graphes avec le principe MDL

Abstract : Many graph pattern mining algorithms have been designed to identify recurring structures in graphs. The main drawback of these approaches is that they often extract too many patterns for human analysis. Recently, pattern mining methods using the Minimum Description Length (MDL) principle have been proposed to select a characteristic subset of patterns from transactional, sequential and relational data. In this paper, we propose a MDL-based approach for selecting a characteristic subset of patterns on labeled graphs. A key notion in this paper is the introduction of ports to encode connections between pattern occurrences without any loss of information. Experiments show that the number of patterns is drastically reduced, and the selected patterns can have complex shapes.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-02511412
Contributor : Francesco Bariatti <>
Submitted on : Wednesday, March 18, 2020 - 5:35:43 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:56 PM
Document(s) archivé(s) le : Friday, June 19, 2020 - 2:37:46 PM

File

egc_graphMDL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02511412, version 1

Citation

Francesco Bariatti, Peggy Cellier, Sébastien Ferré. GraphMDL : sélection de motifs de graphes avec le principe MDL. EGC 2020, Jan 2020, Bruxelles, Belgique. ⟨hal-02511412⟩

Share