PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Lucchese C., Orlando S., Perego R. kDCI: on using direct count up to the third iteration. In: ICDM - ICDM Workshop on Frequent Itemset Mining Implementations (Brighton, UK, 1 November 2004). Proceedings, pp. 1 - 1. CEUR-WS.org, 2004.
 
 
Abstract
(English)
We thus introduced such technique in the last version of kDCI, which is level-wise hybrid algorithm. kDCI stores the dataset with an horizontal format to disk during the first iterations. After some iteration the dataset may become small enough (thanks to anti-monotone frequency pruning) to be stored in the main memory in a vertical format, and after that the algorithm goes on performing tid-lists intersections to retrieve itemsets supports, and searches among candidates are not needed anymore. Usually the dataset happens to be small enough at most at the fourth iteration.
URL: http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-126/
Subject Frequent itemsets 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