Sciweavers

148 search results - page 3 / 30
» Mining top-K frequent itemsets from data streams
Sort
View
CIKM
2009
Springer
14 years 5 days ago
Mining frequent itemsets in time-varying data streams
Mining frequent itemsets in data streams is beneficial to many real-world applications but is also a challenging task since data streams are unbounded and have high arrival rates...
Yingying Tao, M. Tamer Özsu
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 7 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
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
14 years 6 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
13 years 11 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
CORR
2004
Springer
146views Education» more  CORR 2004»
13 years 5 months ago
Mining Frequent Itemsets from Secondary Memory
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...
Gösta Grahne, Jianfei Zhu