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

Frédéric Pennerath 1, 2 Amedeo Napoli 2
2 ORPAILLEUR - Knowledge representation, reasonning
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00437536
Contributor : Sébastien van Luchene <>
Submitted on : Monday, November 30, 2009 - 6:12:29 PM
Last modification on : Tuesday, July 9, 2019 - 11:58:02 AM

Links full text

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

383