Average-case analysis of classification algorithms for boolean functions and decision trees

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

Volumn 1968, Issue , 2000, Pages 194-208

  Scheffer, Tobias ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; ERRORS; GRAPHIC METHODS; LEARNING ALGORITHMS;

AVERAGE-CASE ANALYSIS; CLASSIFICATION ALGORITHM; DECISION-TREE ALGORITHM; ERROR HISTOGRAMS; GENERALIZATION ERROR; LEARNING PROBLEM; REALISTIC SCENARIO; SAMPLE SIZES;

BOOLEAN FUNCTIONS;

EID: 84974710118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40992-0_15     Document Type: Conference Paper

References (19)

1. P. Domingos. A process-oriented heuristic for model selection. In Proceedings of the Fifteenth International Conference on Machine learning, pages 127-135, 1998.
2. P. Domingos. Process-oriented estimation of generalization error. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligenct, 1999.
3. K. Fukumizu. Generalization error of linear neural networks in unidentifiable cases. In Proceedings of the Tenth International Conference on Algorithmic Learning Theory, 1999
4. W. Gilks, S. Richardson, and D. Spiegelhalter, editors. Markov Chain Monte Carlo in Practice. Chapman & Hall, 1995.
5. D. Haussler, M. Kearns, S. Seung, and N. Tishby. Rigorous learning curve bounds from statistical mechanics. Machine Learning, 25, 1996.
6. David Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, September 1992.
7. W. Iba and P. Langley. Induction of one-level decision trees. In Proceedings of the Ninth International Conference on Machine Learning, pages 233-240, 1992.
8. J. Langford and D. McAllester. Computable shell decomposition bounds. In Proceedings of the International Conference on Computational Learning Theory, 2000.
9. P. Langley and S. Sage. Tractable average case analysis of naive bayes classifiers. In Proceedings of the Sixteenth International Conference on Machine Learning, pages 220-228, 1999.
10. Pat Langley, Wayne Iba, and Kevin Thompson. An analysis of bayesian classifiers. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 223-228, 1992.
11. S. Okamoto and Y. Nobuhiro. An average-case analysis of the k-nearest neighbor classifier for noisy domains. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 238-243, 1997.
12. S. Okamoto and N. Yugami. Generalized average-case analysis of the nearest neighbor algorithm. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 695-702, 2000.
13. Rüdiger Reischuk and Thomas Zeugmann. Learning 1-variable pattern languages in linear average time. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 198-208, 1998.
14. T. Scheffer. Error Estimation and Model Selection. Infix Publisher, Sankt Augustin, 1999.
15. T. Scheffer. Nonparametric regularization of decision trees. In Proceedings of the European Conference on Machine Learning, 2000.
16. T. Scheffer. Predicting the generalization performance of cross validatory model selection criteria. In Proceedings of the International Conference on Machine Learning, 2000.
17. T. Scheffer and T. Joachims. Estimating the expected error of empirical minimizers for model selection. Technical Report TR 98-9, Technische Universitaet Berlin, 1998.
18. T. Scheffer and T. Joachims. Estimating the expected error of empirical minimizers for model selection (abstract). In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 1998.
19. T. Scheffer and T. Joachims. Expected error analysis for model selection. In Proceedings of the Sixteenth International Conference on Machine Learning, 1999.