Sciweavers

288 search results - page 4 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
KAIS
2006
164views more  KAIS 2006»
15 years 6 days ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
KAIS
2008
114views more  KAIS 2008»
15 years 7 days ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 5 months ago
Computing Frequent Itemsets Inside Oracle 10G
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
Wei Li, Ari Mozes
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 20 days ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 20 days ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici