PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bonchi F., Lucchese C. Pushing tougher constraints in frequent pattern mining. In: Advances in Knowledge Discovery and Data Mining, Pacific-Asia (Hanoi, Vietnam, May 18-20, 2005). Proceedings, pp. 114 - 124. Ho, Tu Bao and Cheung, David (eds.). (Lecture Notes in Computer Science, vol. 3518). Springer, 2005.
 
 
Abstract
(English)
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-monotone constraints, and we deeply characterize them by showing that they are a superclass of convertible anti-monotone constraints (e.g. constraints on average or median) and that they model tougher constraints (e.g. constraints on variance or standard deviation). Then we show how these constraints can be exploited in a level-wise Apriori-like computation by means of a new data-reduction technique: the resulting algorithm outperforms previous proposals for convertible constraints, and it is to treat much tougher constraints with the same effectiveness of easier ones.
Subject Frequent Itemsets Mining
Constrained Mining
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