Sciweavers

288 search results - page 2 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
RCIS
2010
13 years 3 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 6 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 6 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 5 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 6 months ago
Generalized Closed Itemsets for Association Rule Mining
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...
Vikram Pudi, Jayant R. Haritsa