Combining different methods and numbers of weak decision trees

Pattern Analysis and Applications

Volumn 5, Issue 2, 2002, Pages 201-209

  Latinne, Patrice ^a   Debeir, Olivier ^a   Decaestecker, Christine ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Bagging; Boosting; Decision trees; Ensemble learning; Random subspaces

Indexed keywords

EID: 0036080042     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s100440200018     Document Type: Article

References (35)

1. Ho TK. Data complexity analysis for classifier combination. Proceedings 2nd International Workshop of Multiple Classifier System, Cambridge, UK. Lecture Notes in Computer Science, Springer-Verlag, 2001; 2096:53-67
2. Ho TK, Hull JJ, Srihari SN. Decision combination in multiple classifier systems. IEEE Trans Pattern Analysis and Machine Intelligence 1994; 16(1):66-75
3. Huang YS, Suen CY. A method of combining multiple experts for the recognition of unconstrained handwritten numerals. IEEE Trans Pattern Analysis and Machine Intelligence 1995; 17(1)
4. Kittler J. Combining classifiers: a theoretical framework. IEEE Trans Pattern Analysis and Applications 1998; 1:18-27
5. Lam L. Classifier combinations: implementations and theoretical issues. Proceedings 1st International Workshop of Multiple Classifier System, Cagliari, Italy. Lecture Notes in Computer Science, Springer-Verlag, 2000; 1857:77-86
6. Xu L, Krzyzak A, Suen CY. Methods of combining multiple classifiers and their applications to handwriting recogntion. IEEE Trans Systems, Man and Cybernetics 1992; 22(3):418-435
7. Ali KM, Pazzani MJ. Error reduction through learning multiple descriptions. Machine Learning 1996; 24:173-202
8. Dietterich TG, Kearns M, Mansour Y. Applying the weak learning framework to understand and improve c4.5. Proceedings 13th International Conference on Machine Learning. Morgan Kaufmann Publishers, 1996; 96-104
9. Ji and Ma. Combinations of weak classifiers. IEEE Trans Neural Network 1997; 7(1):32-42
10. Jiang W. Some theoretical aspects of boosting in the presence of noisy data. Proceedings 18th International Conference on Machine Learning, Williams, MA, 2001; 234-241
11. Schapire RE. The strength of weak learnability. Machine Learning 1990; 5:197-227
12. Oza NC, Turner K. Input decimation ensembles: Decorrelating through dimensionality. Proceedings 2nd International Workshop of Multiple Classifier System, Cambridge, UK. Lecture Notes in Computer Science, Springer-Verlag, 2001; 2096:238-247
13. Turner K, Ghosh J. Classifier combining: analytical results and implications. Proceedings National Conference on Artificial Intelligence - Workshop in Induction of Multiple Learning Models, Portland, OR, 1996
14. Battiti R, Colla AM. Democracy in neural nets: voting schemes for classification. Neural Networks 1995; 7(4):691-708
15. Duin RPW, Tax DMJ. Experiments with classifier combining rules. Proceedings 1st International Workshop of Multiple Classifier System, Cagliari, Italy. Lecture Notes in Computer Science, Springer-Verlag, 2000; 1857:16-29
16. Lam L, Suen CY. Application of majority voting to pattern recognition: an analysis of its behavior and performance. IEEE Trans Systems, Man and Cybernetics 1997; 27(5)
17. Perrone M. Putting it all together: methods for combining neural networks. Advances in Neural Information Processing Systems 6, 1994; 1188-1189
18. Breiman L. Bagging predictors. Machine Learning 1996; 24
19. Bay SD. Nearest neighbor classification from multiple feature subsets. Proceedings 15th International Conference on Machine Learning, Madison, WI, 1998
20. Freund and Schapire. A decision-theoretic generalization of online learning and an application to boosting. J Computer and System Sciences 1997; 55(1):119-139
21. Dietterich TG. An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting and randomization. Machine Learning 2000; 40:139-157
22. Kohavi R, Kunz C. Option decision trees with majority votes. Proceedings 14th International Conference on Machine Learning, San Francisco, CA, 1997; 161-169
23. Zheng Z. Generating classifier committees by stochastically selecting both attributes and training examples. Proceedings 5th Pacific Rim International Conferences on Artificial Intelligence (PRI-CAI'98), Springer-Verlag, 1998; 12-23
24. Quinlan JR. Bagging, boosting, and c4.5. Proceedings 13th National Conference on Artificial Intelligence 1996; 725-730
25. Ho, TK. The random subspace method for constructing decision forests. IEEE Trans Pattern Analysis and Machine Intelligence 1998; 20:832-844
26. Breiman L. Random forests - random features. Technical Report 567, Statistics Department, University of California, Berkeley, CA 94720, September 1999
27. Quinlan JR. C4.5: Programs For Machine Learning. Morgan Kaufmann, San Mateo, CA 1993
28. Blake C, Keogh E, Merz CJ. Uci respository of machine learning databases. [http://www.ics.uci.edu/mlearn/MLRepository.html]. University of California, Department of Information and Computer Science, 1998
29. Breiman L. Arching classifiers. Annals of statistics 1998; 26:801-849
30. Rosenfield GH, Fitzpatrick-Lins K. A coefficient of agreement as a measure of thematic classification accuracy. Photogrammetric Engineering and Remote Sensing 1986; 52(2):223-227
31. Siegel S, Castellan NJ. Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, 2nd ed, 1988
32. Rosner B. Fundamentals of Biostatistics. Duxbury Press (ITP), Belmont, CA, 4th ed, 1995
33. Salzberg S. On comparing classifiers: Pitfalls to avoid and a recommended approach. Data Mining and Knowledge Discovery 1997; 1:317-327
34. Dietterich TG. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation 1998; 10:1895-1923
35. Giacento G, Roli F. Dynamic classifier selection based on multiple classifier behaviour. Pattern Recognition Letters 2001; 34(9):179-181