4 search results - page 1 / 1 » Probabilistic Iterative Expansion of Candidates in Mining Fr... |
FIMI
2003
13 years 6 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
SAC
2006
ACM
13 years 10 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
HICSS
2003
IEEE
13 years 10 months ago
2003
IEEE
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...