Efficient handling of high-dimensional feature spaces by randomized classifier ensembles

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2002, Pages 307-313

  Kolcz, Aleksander ^a   Sun, Xiaomei ^b   Kalita, Jugal ^b  

^a Personalogy Inc   (United States)

^b University of Colorado Colorado Springs   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA STRUCTURES; LEARNING ALGORITHMS; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE;

DATASETS; FEATURE SPACE; RANDOMIZED CLASSIFIER ENSEMBLES;

DATA MINING;

EID: 0242709384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775091.775093     Document Type: Conference Paper

References (20)

1. I. Aleksander and T. J. Stonham. A guide to pattern recognition using random-access memories. IEE Proceedings-E Computers and Digital Techniques, 2(1):29-40, 1979.
2. I. Aleksander, W. Thomas, and P. Bowden. WISARD, a radical new step forward in image recognition. Sensor Rev., 4(3):120-124, 1984.
3. Y. Amit, G. Blanchard, and K. Wilder. Multiple randomized classifiers: MRCL. Technical Report 446, Department of Statistics, University of Chicago, 2000.
4. C. Apté, F. Damerau, and S. M. Weiss. Automated learning of decision rules for text categorization. ACM Transactions on Information Systems, 12(3):233-251, 1994.
5. W. Bledsoe and I. Browning. Pattern recognition and reading by machine. In IRE Joint Computer Conference, pages 225-232, 1959.
6. L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
7. L. Breiman. Arcing classifiers. The Annals of Statistics, 26(3):801-849, 1998.
8. L. Breiman. Random forests. Machine Learning, 24(2):5-32, 2001.
9. T. G. Dietterich. An experimental comparison of three methods of constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2):139-157, 2000.
10. C. Domingo and O. Watanabe. Scaling up a boosting-based learner via adaptive sampling. In Proceedings of the 2000 Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2000), pages 317-328, 2000.
11. Y. Freund and R. E. Schapire. Experiments with a new boosting algorithm. In Proceedings of the Thirteenth International Machine Learning Conference, pages 148-156, 1996.
12. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. The Annals of Statistics, 38(2):337-374, 2000.
13. D. Pavlov, J. Mao, and B. Dom. Scaling-up support vector machines using boosting algorithm. In Proceedings of the 2000 International Conference on Pattern Recognition, 2000.
14. J. A. Reichler and H. D. Harris. Parallel online continuous arcing and a new framework for wrapping parallel ensembles. In Proceedings of IJCAI 2001: International Joint Conference on Artificial Intelligence, Workshop on Wrappers for Performance Enhancement in Knowledge Discovery in Databases, pages 148-156, 2001.
15. R. Rohwer and M. Morciniec. The theoretical and experimental status of the N-tuple classifier. Neural Networks, 11(1):1-14, 1998.
16. R. E. Schapire and Y. Singer. BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2-3):135-168, 2000.
17. V. N. Vapnik. Statistical Learning Theory. John Wiley, New York, 1998.
18. Y. Yang and X. Liu. A re-examination of text categorization methods. In Proceedings of the 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 42-49, 1999.
19. Y. Yang and J. P. Pedersen. A comparative study on feature selection in text categorization. In Proceedings of the Fourteenth International Conference on Machine Learning (ICML'97), pages 412-420, 1997.
20. C. Yu and D. B. Skillicorn. Parallelizing boosting and bagging. Technical Report 2001-442, Department of Computing and Information Science, Queen's University, Kingston, Canada, 2001.