Skip to Main content Skip to Navigation
Conference papers

GraphMDL: Graph Pattern Selection based on Minimum Description Length

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 an 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. The selected patterns have complex shapes and are representative of the data.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-02510517
Contributor : Francesco Bariatti <>
Submitted on : Tuesday, March 17, 2020 - 8:22:38 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:54 PM
Long-term archiving on: : Thursday, June 18, 2020 - 3:59:52 PM

File

ida_graphmdl.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02510517, version 1

Citation

Francesco Bariatti, Peggy Cellier, Sébastien Ferré. GraphMDL: Graph Pattern Selection based on Minimum Description Length. IDA 2020 - Symposium on Intelligent Data Analysis, Apr 2020, Konstanz, Germany. ⟨hal-02510517⟩

Share

Metrics

Record views

154

Files downloads

366