872 search results - page 45 / 175 » Real world performance of association rule algorithms |
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a multi modal sequential importance resampling particle filter algorithm for object tracking. We consider a hidden state sequence linked to several observation sequence...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
116
click to vote
NAA
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
105
click to vote
DAWAK
2010
Springer
14 years 10 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...