Sciweavers

34 search results - page 1 / 7
» Recursion Pruning for the Apriori Algorithm
Sort
View
FIMI
2004
134views Data Mining» more  FIMI 2004»
13 years 6 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt
AI
1998
Springer
13 years 4 months ago
Pruning Algorithms for Multi-Model Adversary Search
The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prov...
David Carmel, Shaul Markovitch
ICASSP
2010
IEEE
13 years 4 months ago
Fixed-budget kernel recursive least-squares
We present a kernel-based recursive least-squares (KRLS) algorithm on a fixed memory budget, capable of recursively learning a nonlinear mapping and tracking changes over time. I...
Steven Van Vaerenbergh, Ignacio Santamaría,...
AUSAI
2001
Springer
13 years 8 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
13 years 8 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...