A data complexity analysis of comparative advantages of decision forest constructors

Pattern Analysis and Applications

Volumn 5, Issue 2, 2002, Pages 102-112

  Ho, Tin Kam ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Bagging; Classifier combination; Data complexity; Decision forest; Decision tree; Random subspace method

Indexed keywords

EID: 0036083445     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s100440200009     Document Type: Article

References (32)

1. Devroye L. Any discrimination rule can have an arbitrarily bad probability of error for finite sample size. IEEE Trans Pattern Analysis and Machine Intelligence 1982; 4(2): 154-157
2. Sohn SY. Meta analysis of classification algorithms for pattern recognition. IEEE Trans Pattern Analysis and Machine Intelligence 1999; 21(11): 1137-1144
3. Ho TK, Basu M. Measuring the complexity of classification problems. Proceedings 15th International Conference on Pattern Recognition, Barcelona, 2000; 2: 43-47
4. Ho TK, Basu M. Complexity measures of supervised classification problems, IEEE Trans Pattern Analysis and Machine Intelligence 24(3): 289-300
5. Ho TK. Random decision forests. Proceedings 3rd International Conference on Document Analysis and Recognition, Montreal, 1995; 278-282
6. Murthy S, Kasif S, Salzberg S. A system for induction of oblique decision trees. J Artificial Intelligence Research 1994; 2(1): 1-32
7. Breiman L. Bagging predictors. Machine Learning 1996; 24: 123-140
8. Ho TK. The random subspace method for constructing decision forests. IEEE Trans Pattern Analysis and Machine Intelligence 1998; 20(8): 832-844
9. Ho TK, Baird HS. Large-scale simulation studies in image pattern recognition. IEEE Trans Pattern Analysis and Machine Intelligence 1997; 19(10): 1067-1079
10. Li M, Vitanyi P. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, 1993
11. Foley DH. Considerations of sample and feature size. IEEE Trans Information Theory 1972; 18(5): 618-626
12. Kanal L, Chandrasekaran B. On dimensionality and sample size in statistical pattern classification. Pattern Recognition 1971; 3: 225-234
13. Mehrotra KG, Mohan CK, Ranka S. Bounds on the number of samples needed for neural learning. IEEE Trans Neural Networks 1991; 2(6): 548-558
14. Raudys S, Jain AK. Small sample size effects in statistical pattern recognition: Recommendations for practitioners. IEEE Trans Pattern Analysis and Machine Intelligence 1991; 13(3): 252-264
15. Vapnik V. Statistical Learning Theory. Wiley, 1998
16. Kleinberg EM. An overtraining-resistant stochastic modeling method for pattern recognition. Annals of Statistics 1996; 4(6): 2319-2349
17. Berlind R. An Alternative Method of Stochastic Discrimination with Applications to Pattern Recognition. Doctoral Dissertation, Department of Mathematics, State University of New York at Buffalo, 1994
18. Fukunaga K, Kessell DL. Estimation of classification error. IEEE Trans Computers 1971; 20(12): 1521-1527
19. Hand DJ. Recent advances in error rate estimation. Pattern Recognition Letters 1986; 4: 335-346
20. Kittler J, Devijver PA. Statistical properties of error estimators in performance assessment of recognition systems. IEEE Trans Pattern Analysis and Machine Intelligence 1982; 4(2): 215-220
21. Toussaint GT. Bibliography on estimation of misclassification. IEEE Trans Information Theory 1974; 20(4): 472-479
22. Maciejowski JM. Model discrimination using an algorithmic information criterion. Automatica 1979; 15: 579-593
23. Friedman JH, Rafsky LC. Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests. Annals of Statistics 1979; 7(4): 697-717
24. Lebourgeois F, Emptoz H. Pretopological approach for supervised learning. Proceedings 13th International Conference on Pattern Recognition, Vienna, 1996; D256-260
25. Hoekstra A, Duin RPW. On the nonlinearity of pattern classifiers. Proceedings 13th ICPR, Vienna, 1996; D271-275
26. Basu M, Ho TK. The learning behavior of single neuron classifiers on linearly separable or nonseparable input. Proceedings International Joint Conference on Neural Networks, Washington, DC, July 1999
27. Duin RPW. Compactness and complexity of pattern recognition problems. In: Perneel C (ed), Proc Int Symposium on Pattern Recognition, In Memoriam Pierre Devijver, Royal Military Academy, Brussels, 1999; 124-128
28. Bottou L, Vapnik V. Local learning algorithms. Neural Computation 1992; 4(6): 888-900
29. Ho TK, Hull JJ, Srihari SN. Decision combination in multiple classifier systems. IEEE Trans Pattern Analysis and Machine Intelligence 1994; 16(1): 66-75
30. Lee DS. A Theory of Classifier Combination: The Neural Network Approach. Doctoral Dissertation, Department of Computer Science, State University of New York at Buffalo, 1995
31. Woods K, Kegelmeyer KP Jr, Bowyer K. Combination of multiple classifiers using local accuracy estimates. IEEE Trans Pattern Analysis and Machine Intelligence 1997; 19(4): 405-410
32. Freund Y, Schapire RE. Experiments with a new boosting algorithm. Proceedings 13th International Conference on Machine Learning, Bari, Italy, 1996; 148-156