PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bonchi F., Giannotti F. Pushing constraints to detect local patterns. Morik, Katharina and Boulicaut Jean-Francois and Siebes, Arno (eds.). (Lecture Notes in Computer Science, vol. 3539). Berlin / Heidelberg: Springer, 2005.
 
 
Abstract
(English)
The main position of this paper is that constraints can be a very useful tool in the search for local patterns. The justification for our position is twofold. On one hand, pushing constraints makes feasi- ble the computation of frequent patterns at very low frequency levels, which is where local patterns are. On the other hand constraints can be exploited to guide the search for those patterns showing deviating, surprising characteristics. We rst review the many definitions of local patterns. This review leads us to justify our position. We then provide a survey of techniques for pushing constraint into the frequent pattern computation.
Subject Local patterns
Constraint-based patter discovery
H.2.8 Database 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