Random ordinality ensembles: A novel ensemble method for multi-valued categorical data

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

Volumn 5519 LNCS, Issue , 2009, Pages 222-231

  Ahmad, Amir ^a   Brown, Gavin ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Binary splits; Data fragmentation; Decision trees; Multi way splits; Random Ordinality

Indexed keywords

BINARY SPLITS; BRANCHING FACTORS; CATEGORICAL ATTRIBUTES; CATEGORICAL DATA; CONTINUOUS SPACES; DATA FRAGMENTATION; DATA SETS; EMPIRICAL EVALUATIONS; ENSEMBLE METHODS; INFORMATION GAIN; MULTI-WAY SPLITS; RANDOM FORESTS; RANDOM ORDINALITY; RANDOM PROJECTIONS; SIMPLE METHOD; THEORETICAL STUDY;

CLASSIFIERS; DECISION TREES; LEARNING SYSTEMS;

BINARY TREES;

EID: 70349306580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02326-2_23     Document Type: Conference Paper

References (15)

1. Alpaydin, E.: Combined 5 × 2 cv f Test Comparing Supervised Classification Learning Algorithms. Neural Computation 11(8), 1885-1892 (1999)
2. Bratko, I., Kononenko, I.: Learning Diagnostic Rules from Incomplete and Noisy Data, Seminar on AI Methods in Statistics, London (1986)
3. Breiman, L.: Bagging Predictors. Machine Learning 24(2), 123-140 (1996)
4. Breiman, L.: Random Forests. Machine Learning 45(1), 5-32 (2001)
5. Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and Regression Trees. Wadsworth International Group, CA (1985)
6. Dietterich, T.G.: Appro×imate Statistical Tests for Comparing Supervised Classification Learning Algorithms. Neural Computation 10, 1895-1923 (1998)
7. Dietterich, T.G.: Ensemble Methods in Machine Learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1-15. Springer, Heidelberg (2000)
8. Dietterich, T.G.: An E×perimental Comparison of Three Methods for Constructing Ensembles of Decision trees: Bagging, Boosting, and randomization. Machine Learning 40(2), 1-22 (2000)
9. Fayyad, U.M., Irani, K.B.: The Attribute Selection Problem in Decision Tree Generation. In: Proc. AAAI 1992. MIT Press, Cambridge (1992)
10. Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences 55(1), 119-139 (1997)
11. Geurts, P., Ernst, D., Wehenkel, L.: E×tremely Randomized Trees. Machine Learning 63(1), 3-42 (2006)
12. Kuncheva, L.I.: Combining Pattern Classifiers: Methods and Algorithms. Wiley- Interscience, Hoboken (2004)
13. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)
14. Vilalta, R., Bli×, G., Rendell, L.: Global Data Analysis and the Fragmentation Problem in Decision Tree Induction. In: Proceedings of the 9th European Conference on Machine Learning, pp. 312-328 (1997)
15. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)