LOCUST: An online analytical processing framework for high dimensional classification of data streams

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 426-435

  Aggarwal, Charu C ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DATA MINING; DATA PROCESSING; DECISION SUPPORT SYSTEMS; FILE ORGANIZATION; INFORMATION MANAGEMENT; MINING; RIVERS; SEARCH ENGINES; TECHNOLOGY;

CLASSIFICATION APPROACH; CLASSIFICATION METHODS; CLASSIFICATION PROCESSES; DATA ENGINEERING; DATA SETS; DATA STREAMING; DATA-MINING ALGORITHMS; HARDWARE AND SOFTWARE; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL CLASSIFICATION; HIGH-DIMENSIONAL DATA; INTERMEDIATE DATA; INTERNATIONAL CONFERENCES; MINING PROBLEMS; ON-LINE-ANALYTICAL PROCESSING; RESOURCE AVAILABILITIES;

DATA STRUCTURES;

EID: 52649107516     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497451     Document Type: Conference Paper

References (16)

1. C. C. Aggarwal, J. Han, J. Wang, and P. Yu, "On Demand Classification of Data Streams," in KDD Conference Proceedings, 2004.
2. C. C. Aggarwal, 'Data Streams: Models and Algorithms," Springer, 2007.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, "Models and Issues in Data Stream Systems," in ACM PODS Conference Proceedings, 2002.
4. L. Breiman, "Random Forests," in Machine Learning Journal, vol. 45, no. 1, pp. 5-32, 2001.
5. P. Domingos, and G. Hulten, "Mining High-Speed Data Streams," in ACM KDD Conference Proceedings, 2000.
6. R. Duda, and P. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1973.
7. J. H. Friedman, A recursive partitioning decision rule for non-parametric classifiers, IEEE Trans. on Computers, vol. C-26, pp. 404-408, 1977.
8. G. Hulten, L. Spencer, and P. Domingos, "Mining Time Changing Data Streams," in ACM KDD Conference Proceedings, 2001.
9. F. Farnstrom, J. Lewis, and C. Elkan, "Scalability for Clustering Algorithms Revisited", in ACM SIGKDD Explorations, Vol. 2, no. 1, 2000, pp. 51-57.
10. J. Friedman, R.Kohavi, and Y. Yun, "Lazy Decision Trees," in AAAI Conference, 1996.
11. J. Gama, R. Rocha, and P. Medas, "Accurate Decision Trees for Mining High-Speed Data Streams," in ACM KDD Conference Proceedings, 2003.
12. R. Jin, and G. Agrawal, "Efficient Decision Tree Construction on Streaming Data," in ACM KDD Conference Proceedings, 2003.
13. O. Maron, and A. W. Moore, "The Racing Algorithm: Model Selection for Lazy Learners," Artificial Intelligence Review, 1997.
14. S. K. Murthy, "Automatic construction of decision trees from data: a multidisciplinary survey," DMKD Journal, number 2, pp. 345-389, 1998.
15. H. Wang, W. Fan, P. Yu, and J. Han, "Mining Concept-Drifting Data Streams Using Ensemble Classifiers," in ACM KDD Conference Proceedings, 2003.
16. http://www.cs.uci.edu/~mlearn