288 search results - page 5 / 58 » Estimating the number of frequent itemsets in a large databa... |
128
click to vote
DAWAK
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
119
click to vote
CINQ
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
112
click to vote
CORR
2004
Springer
15 years 3 days ago
2004
Springer
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
207
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
FSKD
2005
Springer
15 years 5 months ago
2005
Springer
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...