The key point of this article is that, in frequent pattern mining, the most appropriate way of exploiting monotone constraints in conjunction with frequency is to use them in order to reduce the input data; this reduction in turn induces a stronger pruning of the search space of the problem. Following this intuition, we introduce ExAMiner, a breadth-first algorithm that exploits the real synergy of antimonotone and monotone constraints: the total benefit is greater than the sum of the two individual benefits. ExAMiner generalizes the basic idea of the preprocessing algorithm ExAnte (Bonchi et al. 2003(b)), embedding such ideas at all levels of an Apriori-like computation. The resulting algorithm is the generalization of the Apriori algorithm when a conjunction of monotone constraints is conjoined to the frequency antimonotone constraint. Experimental results confirm that this is, so far, the most efficient way of attacking the computational problem in analysis.
Efficient breadth-first mining of frequent pattern with monotone constraints
Bonchi F;Giannotti F;
2005
Abstract
The key point of this article is that, in frequent pattern mining, the most appropriate way of exploiting monotone constraints in conjunction with frequency is to use them in order to reduce the input data; this reduction in turn induces a stronger pruning of the search space of the problem. Following this intuition, we introduce ExAMiner, a breadth-first algorithm that exploits the real synergy of antimonotone and monotone constraints: the total benefit is greater than the sum of the two individual benefits. ExAMiner generalizes the basic idea of the preprocessing algorithm ExAnte (Bonchi et al. 2003(b)), embedding such ideas at all levels of an Apriori-like computation. The resulting algorithm is the generalization of the Apriori algorithm when a conjunction of monotone constraints is conjoined to the frequency antimonotone constraint. Experimental results confirm that this is, so far, the most efficient way of attacking the computational problem in analysis.File | Dimensione | Formato | |
---|---|---|---|
prod_44133-doc_33199.pdf
solo utenti autorizzati
Descrizione: Efficient breadth-first mining of frequent pattern with monotone constraints
Tipologia:
Versione Editoriale (PDF)
Dimensione
324.95 kB
Formato
Adobe PDF
|
324.95 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
prod_44133-doc_36549.pdf
solo utenti autorizzati
Descrizione: articolo pubblicato
Tipologia:
Versione Editoriale (PDF)
Dimensione
986.75 kB
Formato
Adobe PDF
|
986.75 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.