Parameter estimation in semi-random decision tree ensembling on streaming data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5476 LNAI, Issue , 2009, Pages 376-388

  Li, Peipei ^a,b   Liang, Qianhui ^a   Wu, Xindong ^b,c   Hu, Xuegang ^b  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b HEFEI UNIVERSITY OF TECHNOLOGY   (China)

^c University of Vermont   (United States)

Author keywords

Data streams; Parameter estimation; Random decision trees

Indexed keywords

BASE CLASSIFIERS; DATA STREAMS; DESIGN STRATEGIES; EBUSINESS; GENERATION PROCESS; HEIGHT OF A TREE; LOSS FUNCTIONS; PREDICTIVE ACCURACY; RANDOM DECISION TREES; SEMI-RANDOM; STREAMING DATA;

CLASSIFIERS; DATA COMMUNICATION SYSTEMS; DATA MINING; DATA STRUCTURES; DECISION TREES; ELECTRONIC COMMERCE; LEARNING SYSTEMS; METAL ANALYSIS; MINING; MOBILE TELECOMMUNICATION SYSTEMS; RANDOM ERRORS;

PARAMETER ESTIMATION;

EID: 67650671582     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01307-2_35     Document Type: Conference Paper

References (15)

1. Gama, J., Rocha, R., Medas, P.: Accurate decision trees for mining high-speed data streams. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 523-528 (2003)
2. Fan, W., Wang, H., Yu, P.S., Ma, S.: Is random model better? On its accuracy and efficiency. In: 3rd IEEE International Conference on Data Mining, pp. 51-58 (2003)
3. Breiman, L.: Random forests. Machine Learning 45(1), 5-32 (2001) (Pubitemid 32933532)
4. Gao, J., Fan, W., Han, J.: On Appropriate Assumptions to Mine Data Streams: Analysis and Practice. In: 7th IEEE International Conference on Data Mining, Omaha, Nebraska, USA, pp. 143-152 (2007)
5. Ho, T.K.: The Random Subspace Method for Constructing Decision Forests. IEEE Trans. Pattern Analysis and Machine Intelligence 20(8), 832-844 (1998) (Pubitemid 128741345)
6. Domingos, P., Hulten, G.: Mining High-Speed Data Streams. In: 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, pp. 71-80 (2000)
7. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58, 13-30 (1963)
8. Blake, C., Keogh, E., Merz, C.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
9. Yahoo! shopping web services, http://developer.yahoo.com/everything.html
10. Hu, X., Li, P., Wu, X., Wu, G.: A Semi-Random Multiple Decision-Tree Algorithm for Mining Data Streams. Journal of Computer Science and Technology 22(5), 711-724 (2007) (Pubitemid 47428882)
11. Gehrke, J., Ganti, V., Ramakrishnan, R., Loh, W.-Y.: BOAT-optimistic decision tree construction. In: 1999 ACM SIGMOD International Conference on Management of Data, pp. 169-180 (1999)
12. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
13. Shafer, J., Agrawal, R., Mehta, M.: SPRINT: A scalable parallel classifier for data mining. In: 22nd International Conference onVery Large Databases, pp. 544-555. Morgan Kaufmann, San Francisco (1996)
14. Fan, W.: On the Optimality of Probability Estimation by Random Decision Trees. In: 9th National Conference on Artificial Intelligence (AAAI 2004), pp. 336-341. AAAI Press, San Jose (2004)
15. Maron, O., Moore, A.W.: Hoeffding races: Accelerating model selection search for classification and function approximation. In: Cowan, J.D., Tesauro, G., Alspector, J. (eds.) Advances in Neural Information Processing Systems, pp. 59-66. Morgan Kaufmann, San Mato (1994)