165 search results - page 2 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
ICDE
2003
IEEE
14 years 7 months ago
2003
IEEE
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
FSKD
2005
Springer
13 years 11 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...
KDD
2000
ACM
13 years 9 months ago
2000
ACM
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
AMT
2006
Springer
13 years 7 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
AUSAI
2001
Springer
13 years 9 months ago
2001
Springer
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...