Mining Closed Patterns in Relational, Graph and Network Data

Gemma C Garriga 1, * Roni Khardon 2 Luc De Raedt 3
* Auteur correspondant
1 MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Recent theoretical insights have led to the introduction of efficient algorithms for mining closed item-sets. This paper investigates potential generalizations of this paradigm to mine closed patterns in relational, graph and network databases. Several semantics and associated definitions for closed patterns in relational data have been introduced in previous work, but the differences among these and the implications of the choice of semantics was not clear. The paper investigates these implications in the context of generalizing the LCM algorithm, an algorithm for enumerating closed item-sets. LCM is attractive since its run time is linear in the number of closed patterns and since it does not need to store the patterns output in order to avoid duplicates, further reducing memory signature and run time. Our investigation shows that the choice of semantics has a dramatic effect on the properties of closed patterns and as a result, in some settings a generalization of the LCM algorithm is not possible. On the other hand, we provide a full generalization of LCM for the semantic setting that has been previously used by the Claudien system.
Type de document :
Article dans une revue
Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2012
Liste complète des métadonnées

Littérature citée [45 références]  Voir  Masquer  Télécharger
Contributeur : Gemma C Garriga <>
Soumis le : mardi 20 novembre 2012 - 11:17:25
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : samedi 17 décembre 2016 - 12:23:41


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00754967, version 1



Gemma C Garriga, Roni Khardon, Luc De Raedt. Mining Closed Patterns in Relational, Graph and Network Data. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2012. 〈hal-00754967〉



Consultations de la notice


Téléchargements de fichiers