A Multi-armed Bandit Approach to Cost-Sensitive Decision Tree Learning

Several authors have studied the problem of inducing decision trees that aim to minimize costs of misclassification and take account of costs of tests. The approaches adopted vary from modifying the information theoretic attribute selection measure used in greedy algorithms such as C4.5 to using methods such as bagging and boosting. This paper presents a new framework, based on game theory, which recognizes that there is a trade-off between the cost of using a test and the misclassification costs. Cost-sensitive learning is viewed as a Multi-Armed Bandit problem, leading to a novel cost-sensitive decision tree algorithm. The new algorithm is evaluated on five data sets and compared to six well known algorithms J48, EG2, MetaCost, AdaCostM1, ICET and ACT. The preliminary results are promising showing that the new multi-armed based algorithm can produce more cost-effective trees without compromising accuracy.

[1]  Daniël Wedema.  Games And Information An Introduction To Game Theory 3rd Edition , 2011 .

[2]  Kai Ming Ting,et al.  An Empirical Study of MetaCost Using Boosting Algorithms , 2000, ECML.

[3]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[4]  Pedro M. Domingos.  MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.

[5]  Peter D. Turney.  Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm , 1994, J. Artif. Intell. Res..

[6]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[7]  John Shawe-Taylor,et al.  Regret Bounds for Gaussian Process Bandit Problems , 2010, AISTATS 2010.

[8]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[9]  Bruce Bueno de Mesquita,et al.  An Introduction to Game Theory , 2014 .

[10]  Sunil Vadera,et al.  A survey of cost-sensitive decision tree induction algorithms , 2013, CSUR.

[11]  John Shawe-Taylor.  Multivariate Bandits and Their Applications , 2010, Intelligent Information Processing.

[12]  Qiang Yang,et al.  Decision trees with minimal costs , 2004, ICML.

[13]  Charles Elkan,et al.  The Foundations of Cost-Sensitive Learning , 2001, IJCAI.

[14]  Kai Ming Ting,et al.  Boosting Trees for Cost-Sensitive Classifications , 1998, ECML.

[15]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[16]  Mehryar Mohri,et al.  Multi-armed Bandit Algorithms and Empirical Evaluation , 2005, ECML.

[17]  Nicolò Cesa-Bianchi,et al.  Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[18]  Usama M. Fayyad,et al.  Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning , 1993, IJCAI.

[19]  John Langford,et al.  Cost-sensitive learning by cost-proportionate example weighting , 2003, Third IEEE International Conference on Data Mining.

[20]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[21]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[22]  Peter D. Turney.  Types of Cost in Inductive Concept Learning , 2002, ArXiv.

[23]  Peter Auer,et al.  Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..

[24]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[25]  Dorota Glowacka,et al.  GAUSSIAN PROCESS MODELLING OF DEPENDENCIES IN MULTI-ARMED BANDIT PROBLEMS , 2009 .

[26]  Sunil Vadera,et al.  An empirical comparison of cost‐sensitive decision tree induction algorithms , 2011, Expert Syst. J. Knowl. Eng..

[27]  Morton D. Davis.  Game Theory: A Nontechnical Introduction , 1970 .

[28]  Marlon Núñez.  The use of background knowledge in decision tree induction , 2004, Machine Learning.

[29]  John Shawe-Taylor,et al.  Gaussian Process Bandits for Tree Search , 2010, ArXiv.

[30]  Paul Compton,et al.  Inductive knowledge acquisition: a case study , 1987 .

[31]  Salvatore J. Stolfo,et al.  AdaCost: Misclassification Cost-Sensitive Boosting , 1999, ICML.

[32]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[33]  Ken Binmore,et al.  Game theory - a very short introduction , 2007 .

[34]  Shaul Markovitch,et al.  Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach , 2008, J. Artif. Intell. Res..

[35]  Kai Ming Ting,et al.  Boosting Cost-Sensitive Trees , 1998, Discovery Science.