Abstract
This paper defines a class of problems involving combinations of induction and (cost) optimisation. A framework is presented that systematically describes problems that involve construction of decision trees or rules, optimising accuracy as well as measurement- and misclassification costs. It does not present any new algorithms but shows how this framework can be used to configure greedy algorithms for constructing such trees or rules. The framework covers a number of existing algorithms. Moreover, the framework can also be used to define algorithm configurations with new functionalities, as expressed in their evaluation functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Langley, P. (1996). Elements of machine learning. Morgan Kaufmann, San Francisco.
Nunez, M. (1991). The use of background knowledge in decision tree induction. Machine Learning, 6:231–250.
Quinlan, J. (1986). Induction of decision trees. Machine Learning, 1:81–106.
Quinlan, J. (1992). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco.
Riddle, P., Segal, R., and Etzioni, O. (1994). Representation design and brute-force induction in a boeing manufacturing domain. Applied Artificial Intelligence, 8:125–147.
Roberts, H., Denby, M., and Totton, K. (1995). Accounting for misclassification costs in decision tree classifiers. In Lasker, G. and Liu, X., editors, Proceedings of the International Symposium on Intelligent Data Analysis, IDA-95, pages 149–156.
Schiffers, J. (1997). A classification approach incorporating misclassification cost. Intelligent Data Analysis, Vol. 1, No. 1, http://www.elsevier.com/locate/ida
Torres, C. and Verdenius, F. (1996). Selecting decision-tree based learning algorithms. In van der Herik, H., van den Bosch, A., and Weijters, T., editors, Proceedings Benelearn-1996, Maastricht. RU Maastricht.
Turney, P. D. (1995). Cost sensitive classification: Empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of AI Research, 2:369–409.
Verdenius, F. (1991). A method for inductive cost optimization. In Kodratoff, Y., editor, Proceedings of the Fifth European Working Session on Learning EWSL-91, pages 179–191, Berlin. Springer Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
van Someren, M., Torres, C., Verdenius, F. (1997). A systematic description of greedy optimisation algorithms for cost sensitive generalisation. In: Liu, X., Cohen, P., Berthold, M. (eds) Advances in Intelligent Data Analysis Reasoning about Data. IDA 1997. Lecture Notes in Computer Science, vol 1280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052845
Download citation
DOI: https://doi.org/10.1007/BFb0052845
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63346-4
Online ISBN: 978-3-540-69520-2
eBook Packages: Springer Book Archive