Contributo in atti di convegno, 2005, ENG
Bonchi F.; Giannotti F.; Pedreschi D.
CNR-ISTI, Pisa, Italy; Dipartimento di Informatica, Università di Pisa, Pisa, Italy - CNR-ISTI, Pisa, Italy; Dipartimento di Informatica, Università di Pisa, Pisa, Italy - CNR-ISTI, Pisa, Italy;
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-o between expressive- ness and eciency 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-de ned 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 de ned 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 eciencly xecuted, by the state-of-the-art optimization techniques based on pushing the var- ious form of constraints by means of data reduction.
European Workshop on Inductive Databases and Constraint Based Mining, pp. 14–37, Hinterzarten, Germany, 11-13 March 2004
Frequent pattern mining, Constraints. Data mining query language, Database Applications
Pedreschi Dino, Giannotti Fosca, Coltelli Primo
ISTI – Istituto di scienza e tecnologie dell'informazione "Alessandro Faedo"
ID: 43803
Year: 2005
Type: Contributo in atti di convegno
Creation: 2009-06-16 00:00:00.000
Last update: 2018-08-01 15:14:32.000
CNR authors
External IDs
CNR OAI-PMH: oai:it.cnr:prodotti:43803