Input decimation ensembles: Decorrelation through dimensionality reduction

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

Volumn 2096, Issue , 2001, Pages 238-247

  Oza, Nikunj C ^a   Tumer, Kagan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AMOUNT OF CORRELATIONS; DIMENSIONALITY REDUCTION; ENSEMBLE OF CLASSIFIERS; ENSEMBLE PERFORMANCE; GENERALIZATION PERFORMANCE; MACHINE LEARNING PROBLEM; PERFORMANCE LEVEL; SYNTHETIC DATASETS;

CLASSIFICATION (OF INFORMATION);

EID: 84944215019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48219-9_24     Document Type: Conference Paper

References (17)

1. K.M. Ali and M.J. Pazzani. On the link between error correlation and error reduction in decision tree ensembles. Technical Report 95-38, Department of Information and Computer Science, University of California, Irvine, 1995.
2. S.D. Bay. Combining nearest neighbor classifiers through multiple feature subsets. In Proc. 15th ICML, pages 415-425. Morgan Kaufmann, 1998.
3. J. O. Berger. Statistical Decision Theory and Bayesian Analysis. (2nd Ed.), Springer, New York, 1985.
4. L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
5. T.G. Dietterich and G. Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of AI Research, 2:263-286, 1995.
6. Thomas G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40:139-158, Aug. 2000.
7. Y. Freund and R. Schapire. Experiments with a new boosting algorithm. In Proc. 13th ICML, pages 148-156, Bari, Italy, 1996. Morgan Kaufmann.
8. I.T. Jolliffe. Principal Component Analysis. Springer-Verlag, 1986.
9. A. Krogh and J. Vedelsby. Neural network ensembles, cross validation and active learning. In G. Tesauro, D.S. Touretzky, and T.K. Leen, editors, Advances in Neural Information Processing Systems-7, pages 231-238. M.I.T. Press, 1995.
10. C.J. Merz. Classification and Regression by Combining Models. PhD thesis, University of California, Irvine, Irvine, CA, May 1998.
11. N.C. Oza and K. Tumer. Dimensionality reduction through classifier ensembles. Technical Report NASA-ARC-IC-1999-126, NASA Ames Research Center, 1999.
12. M.D. Richard and R.P. Lippmann. Neural network classifiers estimate Bayesian a posteriori probabilities. Neural Computation, 3(4):461-483, 1991.
13. K. Tumer and J. Ghosh. Analysis of decision boundaries in linearly combined neural classifiers. Pattern Recognition, 29(2):341-348, February 1996.
14. K. Tumer and J. Ghosh. Error correlation and error reduction in ensemble classifiers. Connection Science, Special Issue on Combining Artificial Neural Networks: Ensemble Approaches, 8(3 & 4):385-404, 1996.
15. K. Tumer and N.C. Oza. Decimated input ensembles for improved generalization. In Proc. of the Int. Joint Conf. on Neural Networks (IJCNN-99), 1999.
16. D. H. Wolpert. Stacked generalization. Neural Networks, 5:241-259, 1992.
17. Z. Zheng and G.I. Webb. Stochastic attribute selection committees. In Proc. of the 11th Australian Joint Conf. on AI (AI’98), pages 321-332, 1998.