Structure and majority classes in decision tree learning

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 1747-1768

  Hickey, Ray J ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

Attribute selection bias; Decision tree learning; Error decomposition; Majority classes; Sampling error

Indexed keywords

DATA STRUCTURES; ERROR ANALYSIS; LEARNING SYSTEMS; MATHEMATICAL MODELS; SAMPLING;

DECISION TREE LEARNING; ERROR DECOMPOSITION; SAMPLING ERRORS;

DECISION TREES;

EID: 34547874572     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Robert E. Bechhofer, Salah Elmaghraby and Norman Morse. A single sample multiple-decision procedure for selecting the multinomial event which has the highest probability. Annals of Mathematical Statistics, 30:102-119, 1959.
2. Leo Breiman, Jerome H. Friedman, Richard A. Olshen and Charles J. Stone. Classification and Regression Trees. Wadsworth, Pacific Grove, California, 1984.
3. Eibe Frank. Pruning Decision Trees and Lists. PhD thesis, University of Waikato, Hamilton, New Zealand, 2000.
4. Carlos R.P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra and Carl L. Gerberich. Application of information theory to the construction of efficient decision trees. IEEE Transactions on Information Theory, IT-28:565-577, 1982.
5. Ray J. Hickey. Artificial universes: towards a systematic approach to evaluating algorithms which learn from examples. In Proceedings of the Ninth International Conference on Machine Learning, pages 196-205, Aberdeen, Scotland, 1992.
6. Ray J. Hickey. Noise modelling and evaluating learning from examples. Artificial Intelligence, 82(1-2):157-179, 1996.
7. Gareth M. James. Variance and bias for general loss functions. Machine Learning, 51(2):115-135, 2003.
8. David D. Jensen and Paul R. Cohen. Multiple comparisons in induction algorithms. Machine Learning, 38(3):309-338, 2000.
9. Harry Kesten and Norman Morse. A property of the multinomial distribution. Annals of Mathematical Statistics, 30:120-127, 1959.
10. Ron Kohavi and George H. John. Wrappers for feature subset selection. Artificial Intelligence, 97(1-2):273-324, 1997.
11. Wei Zhong Liu and Allan P. White. The importance of attribute selection measures in decision tree induction. Machine Learning, 15(1):25-41, 1994.
12. Albert W. Marshall and Ingram Olkin. Inequalities: The Theory of Majorisation and its Applications. Academic Press, New York, 1979.
13. Tom M. Mitchell. Machine Learning. McGraw-Hill, New York, 1997.
14. Tim Oates and David D. Jensen. The effects of training set size on decision tree complexity. In Proceedings of the Fourteenth International Conference on Machine Learning, pages. 254-261, Nashville, Tennessee, 1997.
15. Tim Oates and David D. Jensen. Toward a theoretical understanding of why and when decision tree pruning algorithms fail. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 372-378, Orlando, Florida, 1999.
16. Foster Provost and Pedro Domingos. Tree induction for probability-based ranking. Machine Learning, 52(3):199-215, 2003.
17. J. Ross Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986.
18. Cullen Schaffer. Overfitting avoidance as bias. Machine Learning, 10(2):153-178, 1993.
19. UCI KDD Archive. http://kdd.ics.uci.edu
20. Gary M. Weiss and Haym Hirsh. A quantitative study of small disjuncts. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 665-670, Austin, Texas, 2000.