PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bonchi F., Giannotti F., Pedreschi D. A relational query primitive for constraint-based pattern mining. Boulicaut, Jean-Francois and De Raedt, Luc and Mannila, Heikki. (Lecture Notes in Computer Science, vol. 3848). Springer, 2005.
 
 
Abstract
(English)
As a step towards the design of an Inductive Database Sys- tem, in this paper we present a primitive for constraint-based frequent pattern mining, which represents a careful trade-off between expressive- ness and efficiency. Such primitive is a simple mechanism which takes a relational table in input and extracts from it all frequent patterns which satisfy a given set of user-defined constraints. Despite its simplicity, the proposed primitive is expressive enough to deal with a broad range of interesting constraint-based frequent pattern queries,using a comprehen- sive repertoire of constraints defined over SQL aggregates. Thanks to its simplicity, the proposed primitive is amenable to be smoothly embedded in a variety of data mining query languages and be efficiently executed, by the state-of-the-art optimization techniques based on pushing the various form of constraints by means of data reduction.
Subject Frequent pattern mining
Constraints
Data mining query language
H.2.8 Databases Applications


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional