Finding Maximal Frequent Itemsets over Online Data Streams Adaptively
Authors:
- Daesu LeeDLDaesu Lee
- Wonsuk LeeWLWonsuk Lee
- 5 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Approximating a data stream for querying and estimation: algorithms and performance evaluation2003
- Finding recent frequent itemsets adaptively over online data streams2003
- Querying and mining data streams2002
- Approximate Frequency Counts over Data Streams2002
- Mining time-changing data streams2001
- Mining a stream of transactions for customer patterns2001
- Depth first generation of long patterns2000
- The Item-Set Tree: A Data Structure for Data Mining1999
- Dynamic itemset counting and implication rules for market basket data1997