Cost-sensitive specialization

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

Volumn 1114, Issue , 1996, Pages 23-34

  Webb, Geoffrey I ^a  

^a DEAKIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957865542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61532-6_3     Document Type: Conference Paper

References (16)

1. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, Belmont, Ca, 1984.
2. B. A. Draper, C. E. Brodley, and P. E. Utgoff. Goal-directed classification using linear machine decision trees. IEEE Transactions on Pattern Recognition and Artificial Intelligence, 16:888-893, 1994.
3. D. Gordon and D. Perlis. Explicitly biased generalization. Computational Intelligence, 5(2):67-81, May 1989.
4. R. C. Holte, L. E. Acker, and B. W. Porter. Concept learning and the problem of smM1 disjuncts. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 813-818, Detroit, 1989. Morgan Kaufmann.
5. U. Knoll, G. Nakhaeizadeh, and B. Tausend. Cost-sensitive pruning of decision trees. In F. Bergadano and L. De Raedt, editors, Proceedings of the Eighth European Conference on Machine Learning, ECML-94, pp. 383-386, Catania, Italy, 1994. Springer-Verlag.
6. S. W. Norton. Generating better decision trees. In Proceedings o] the Eleventh International Joint Con]erence on Artificial Intelligence, 1JCAI-89, pp. 800-805, Detroit, MI, 1989. Morgan Kanfmann.
7. M. Nhfiez. The use of background knowledge in decision tree induction. Machine Learning, 6:231-250, 1991.
8. M. J. Pazzani, C. Merz, P. Murphy, K. Ali, T. Hume, and C. Brunk. Reducing misclassification costs. In Proceedings of the Eleventh International Conference on Macine Learning, pp. 217-225, New Jersey, 1994. Morgan Kaufmann.
9. F. J. Provost. Goal-directed inductive learning: Trading off accuracy for reduced error cost. In Proceedings of the AAAI Spring Symposium on Goal Directed Learning, pp. 94-101, 1994.
10. F. J. Provost and B. G. Buchanan. Inductive policy. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 255-261. AAAI Press, 1992.
11. F. J. Provost and B. G. Buchanan. Inductive policy: The pragmatics of bias selection. Machine Learning, 20(1/2):35-61, 1995.
12. J. R. Quinlan. C~.5: Programs For Machine Learning. Morgan Kaufmann, San Mateo, 1993.
13. M. Tan. Cost-sensitive learning of classification knowledge and its applications in robotics. Machine Learning, 13:7-33, 1993.
14. P. D. Turney. Cost-sensitive classification: Empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research, 2:369-409, 1995.
15. G. I. Webb. Generality is more significant than complexity: Toward alternatives to Occam's razor. In C. Zhang, J. Debenham, and D. Lukose, editors, AI'94 - Proceedings of the Seventh Australian Joint Conference on Artificial Intelligence, pp. 60-67, Armidale, 1994. World Scientific.
16. O. I. Webb. Syntactic complexity is not predictive of predictive accuracy: Experimental evidence against Occam's razor. To be published in Journal of Artificial Intelligence Research, 1996.