In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this paper, we integrate the recently proposed ExAnte data reduction technique within the FP-growth algorithm. Together, they result in a very efficient frequent itemset mining algorithm that effectively exploits monotone constraints.
FP-Bonsai: the art of growing and pruning small FP-Trees
Bonchi F;
2004
Abstract
In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this paper, we integrate the recently proposed ExAnte data reduction technique within the FP-growth algorithm. Together, they result in a very efficient frequent itemset mining algorithm that effectively exploits monotone constraints.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_43755-doc_124912.pdf
solo utenti autorizzati
Descrizione: FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Tipologia:
Versione Editoriale (PDF)
Dimensione
173.51 kB
Formato
Adobe PDF
|
173.51 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
