1 "Space- Efficient On-line Computation of Quantile Summaries" 2001.
2 "Online Associattion Rule Mining" 145-156, 1999
3 "Mining sequential patterns" 3-14, 1995
4 "Mining frequent patterns without candidate generation" 1-12, 2000
5 "Mining Time-Changing Data Streams KDD" 2001.
6 G. Hulten, "Mining High-Speed Data Streams" 71-80, 2000
7 "Mining Frequent Patterns in Data Streams at Multiple Time Granularities,Chapter3" MIT Press 2003.
8 "Mining Data Streams under Block Evolution" 3 (3): 1-10, 2002
9 "Mining Concept-Drifting Data Streams Using Ensemble Classifiers" 24-27, 2003
10 "Maintenance of discovered association rules in large databases:An incremental updating technique" 106-114, 1996
1 "Space- Efficient On-line Computation of Quantile Summaries" 2001.
2 "Online Associattion Rule Mining" 145-156, 1999
3 "Mining sequential patterns" 3-14, 1995
4 "Mining frequent patterns without candidate generation" 1-12, 2000
5 "Mining Time-Changing Data Streams KDD" 2001.
6 G. Hulten, "Mining High-Speed Data Streams" 71-80, 2000
7 "Mining Frequent Patterns in Data Streams at Multiple Time Granularities,Chapter3" MIT Press 2003.
8 "Mining Data Streams under Block Evolution" 3 (3): 1-10, 2002
9 "Mining Concept-Drifting Data Streams Using Ensemble Classifiers" 24-27, 2003
10 "Maintenance of discovered association rules in large databases:An incremental updating technique" 106-114, 1996
11 "Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint" 2003
12 "Fast algorithms for mining association rules" 1994.
13 "Data Mining Concepts and Techniques" Morgan Kaufmann 2001.
14 "DEMON:Mining and monitoring evolving data" 439-448, 2000
15 "Clustering Data Streams" 2000.
16 "CLOSET:An efficient algorithm for mining frequent closed item sets" ACM-SIGMOD International workshop of Data Mining and Knowledge Discovery 11-20, 2000
17 "CHARM:An efficient algorithm for closed item set mining" 2002.
18 "BOAT:optimistic decision tree construction" 169-180, 1999
19 "An efficient algorithm to update large item sets with early pruning" nternational Conference on Knowledge Discovery and Data Mining 287-291, 1999