Efficient decision tree construction on streaming data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2003, Pages 571-576

  Jin, Ruoming ^a   Agrawal, Gagan ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Decision tree; Sampling; Streaming data

Indexed keywords

DECISION TREE CONSTRUCTION; EXECUTION TIME; GAIN FUNCTION; HOEFFDING INEQUALITY; NUMBER OF DATUM; NUMERICAL ATTRIBUTES; ONE-PASS; PROBABILISTIC BOUNDS; SAMPLE SIZES; STREAMING DATA;

DECISION TREES; SAMPLING;

DATA MINING;

EID: 77952325551     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956821     Document Type: Conference Paper

References (16)

1. R. Agrawal, T. Imielinski, and A. Swami. Database mining: A performance perspective. IEEE Transactions on Knowledge and Data Eng., 5 (6):914-925, December 1993.
2. A. Arasu, B. Babcock, S. Babu, J. McAlister, and J. Widom. Characterizing memory requirements for queries over continuous data streams. In Proc. of the 2002 ACM Symp. on Principles of Database Systems. ACM Press, June 2002.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data Stream Systems. In Proceedings of the 2002 ACM Symposium on Principles of Database Systems (PODS 2002) (Invited Paper). ACM Press, June 2002.
4. George Casella and Roger L. Berger. Statistical Inference, 2nd. Edition. DUXBURY Publishers, 2001.
5. A. Dobra, J. Gehrke, M. Garofalakis, and R. Rastogi. Processing complex aggregate queries over data streams. In Proc. of the 2002 ACM SIGMOD Intl. Conf. on Management of Data, June 2002.
6. P. Domingos and G. Hulten. Mining high-speed data streams. In Proceedings of the ACM Conference on Knowledge and Data Discovery (SIGKDD), 2000.
7. J. Gehrke, V. Ganti, R. Ramakrishnan, and W. Loh. Boat-optimistic decision tree construction. In Proc. of the ACM SIGMOD Conference on Management of Data, June 1999.
8. J. Gehrke, F. Korn, and D. Srivastava. On computing correlated aggregates over continual data streams. In Proc. of the 2001 ACM SIGMOD Intl. Conf. on Management of Data, pages 13-24. acmpress, June 2001.
9. J. Gehrke, R. Ramakrishnan, and V. Ganti. Rainforest - a framework for fast decision tree construction of large datasets. In VLDB, 1998.
10. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering Data Streams. In Proceedings of 2000 Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 359-366. ACM Press, 2000.
11. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, pages 58:18-30, 1963.
12. Jason C. Hsu. Multiple Comparisons, Theory and methods. Chapman and Hall, 1996.
13. G. Hulten, L. Spencer, and P. Domingos. Mining time-changing data streams. In Proceedings of the ACM Conference on Knowledge and Data Discovery (SIGKDD), 2001.
14. Ruoming Jin and Gagan Agrawal. Efficient Decision Tree Construction on Streaming Data. Technical Report OSU-CISRC-6/03-TR34, Department of Computer and Information Sciences, The Ohio State University, June 2003.
15. M. Mehta, R. Agrawal, and J. Rissanen. Sliq: A fast scalable classifier for data mining. In In Proc. of the Fifth Int'l Conference on Extending Database Technology, Avignon, France, 1996.
16. J. Shafer, R. Agrawal, and M. Mehta. SPRINT: A scalable parallel classifier for data mining. In Proceedings of the 22nd International Conference on Very Large Databases (VLDB), pages 544-555, September 1996.