The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases - IMS - Equipe Information, Multimodalité et Signal Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases

Résumé

This article introduces the class of Most Informative Patterns (MIPs) for characterizing a given dataset. MIPs form a reduced subset of non redundant closed patterns that are extracted from data thanks to a scoring function depending on domain knowledge. Accordingly, MIPs are designed for providing experts good insights on the content of datasets during data analysis. The article presents the model of MIPs and their formal properties wrt other kinds of patterns. Then, two algorithms for extracting MIPs are detailed: the first directly searches for MIPs in a dataset while the second screens MIPs from frequent patterns. The efficiencies of both algorithms are compared when applied to reference datasets. Finally the application of MIPs to labelled graphs, here molecular graphs, is discussed.

Dates et versions

hal-00437536 , version 1 (30-11-2009)

Identifiants

Citer

Frédéric Pennerath, Amedeo Napoli. The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases. European Conference, ECML PKDD 2009, Sep 2009, Bled, Slovenia. pp.205-220, ⟨10.1007/978-3-642-04174-7_14⟩. ⟨hal-00437536⟩
166 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More