GraphMDL: Graph Pattern Selection based on Minimum Description Length - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

GraphMDL: Graph Pattern Selection based on Minimum Description Length

Résumé

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.
Fichier principal
Vignette du fichier
ida_graphmdl.pdf (396.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02510517 , version 1 (17-03-2020)

Licence

Paternité

Identifiants

Citer

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. ⟨10.1007/978-3-030-44584-3_5⟩. ⟨hal-02510517⟩
335 Consultations
329 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More