Sciweavers

85 search results - page 3 / 17
» An Efficient Algorithm for Maintaining Frequent Closed Items...
Sort
View
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
DAWAK
2005
Springer
13 years 10 months ago
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
Shichao Zhang, Xindong Wu, Jilian Zhang, Chengqi Z...
MLDM
2005
Springer
13 years 10 months ago
Statistical Supports for Frequent Itemsets on Data Streams
Abstract. A statistical technique is developed for estimating the support of itemsets on data streams, regardless of the size of the data stored. This technique, which is computati...
Pierre-Alain Laur, Jean-Emile Symphor, Richard Noc...
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 5 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 5 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà