PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bonchi F., Giannotti F., Mazzanti A., Pedreschi D. ExAnte: Anticipated Data Reduction in Constrained Pattern Mining. In: Knowledge Discovery in Databases: PKDD (Cavtat-Dubrovnik, Croatia, 22-26 September 2003). Proceedings, p. 12. Nada Lavrac and Dragan Gamberger and Hendrik Blockeel and Ljupco (eds.). (Lecture Notes in Computer Science, vol. 2838). Springer, 2003.
 
 
Abstract
(English)
Constraint pushing techniques have been proven to be effective in reducing the search space in the frequent pattern mining task, and thus in improving efficiency. But while pushing anti-monotone constraints in a level-wise computation of frequent itemsets has been recognized to be always profitable, the case is different for monotone constraints. In fact, monotone constraints have been considered harder to push in the computation and less effective in pruning the search space. In this paper, we show that this prejudice is ill founded and introduce ExAnte, a pre-processing data reduction algorithm which reduces dramatically both the search space and the input dataset in constrained frequent pattern mining. Experimental results show a reduction of orders of magnitude, thus enabling a much easier mining task. ExAnte can be used as a pre-processor with any constrained pattern mining algorithm.
URL: http://springerlink.metapress.com/app/home/contribution.asp?wasp=3768dxlvmn4vvj
Subject Data Mining
H. Information Systems


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