{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:02:14Z","timestamp":1768971734631,"version":"3.49.0"},"reference-count":67,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxw015","type":"journal-article","created":{"date-parts":[[2016,3,30]],"date-time":"2016-03-30T22:59:00Z","timestamp":1459378740000},"page":"bxw015","source":"Crossref","is-referenced-by-count":7,"title":["A Cost-Sensitive Decision Tree Learning Algorithm Based on a Multi-Armed Bandit Framework"],"prefix":"10.1093","author":[{"given":"Susan","family":"Lomax","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunil","family":"Vadera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,3,30]]},"reference":[{"key":"2016033018434745000_bxw015v1.1","doi-asserted-by":"crossref","unstructured":"Quinlan J.R. (1986) Induction of Decision Trees. Machine Learning 1, pp. 81\u2013106. Kluwer Academic Publishers, Boston.","DOI":"10.1007\/BF00116251"},{"key":"2016033018434745000_bxw015v1.2","unstructured":"Quinlan J.R. (1979) Discovering Rules by Induction from Large Collections of Examples. In Michie, D. (ed.), Expert Systems in the Micro Electronic Age, pp. 168\u2013201. Edinburgh University Press, Edinburgh."},{"key":"2016033018434745000_bxw015v1.3","doi-asserted-by":"crossref","unstructured":"Quinlan J.R. (1983) Learning Efficient Classification Procedures and their Application to Chess end Games. In Michalski, S.R., Garbonell, G.J. and Mitchell, M.T. (eds), Machine Learning: An Artificial Intelligence Approach. Tioga Publishing Company, Palo Alto, CA.","DOI":"10.1007\/978-3-662-12405-5_15"},{"key":"2016033018434745000_bxw015v1.4","unstructured":"Quinlan J.R. (1993) C4.5: Programs for Machine Learning. Morgan Kaufman, San Mateo, CA."},{"key":"2016033018434745000_bxw015v1.5","unstructured":"Breiman L. , Friedman J.H. , Olsen R.A. and Stone C.J. (1984) Classification and Regression Trees. Chapman and Hall\/CRC, London."},{"key":"2016033018434745000_bxw015v1.6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.63","article-title":"A System for induction of oblique decision trees","volume":"2","author":"Murthy","year":"1994","journal-title":"J. Artif. Intell. Res."},{"key":"2016033018434745000_bxw015v1.7","unstructured":"Elkan C. (2001) The Foundations of Cost-sensitive Learning. In Proc. 17th Int. Joint Conf. Artificial Intelligence (IJCAI'01), Vol. 2, pp. 973\u2013978. Morgan Kaufmann, San Francisco, USA."},{"key":"2016033018434745000_bxw015v1.8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1613\/jair.120","article-title":"Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm","volume":"2","author":"Turney","year":"1995","journal-title":"J. Artif. Intell. Res."},{"key":"2016033018434745000_bxw015v1.9","unstructured":"Turney P.D. (2000) Types of Cost in Inductive Concept Learning. In Workshop on Cost-Sensitive Learning at the 17th Int. Conf. Machine Learning (WCSL at ICML-2000), pp. 15\u201321. Stanford University, California."},{"key":"2016033018434745000_bxw015v1.10","unstructured":"Quinlan J.R. , Compton P.J. , Horn K.A. and Lazarus L. (1987) Inductive Knowledge Acquisition: A Case Study. Applications of Expert Systems, Chapter 9. In Ross Quinlan, J. (ed.), Based on the Proc. 2nd Australian Conf., pp. 137\u2013156. Turing Institute Press with Addison-Wesley Publishing Co. ISBN 0-201-17449-9."},{"key":"2016033018434745000_bxw015v1.11","doi-asserted-by":"crossref","unstructured":"Lomax S. and Vadera S. (2013) A survey of cost-sensitive decision tree induction algorithms. ACM Comput. Surv., 45, Article 16.","DOI":"10.1145\/2431211.2431215"},{"key":"2016033018434745000_bxw015v1.12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0394.2010.00573.x"},{"key":"2016033018434745000_bxw015v1.13","unstructured":"Lomax S. and Vadera S. (2009) An Empirical Comparison of Cost-sensitive Decision Tree Algorithms. Proc. 4th Conf. Intelligent Management Systems in Operations, OR, IMSIO4, July 7\u20138, pp. 35\u201347. University of Salford, published by OR Society."},{"key":"2016033018434745000_bxw015v1.14","doi-asserted-by":"crossref","unstructured":"Ting K. (2000) An Empirical Study of MetaCost using Boosting Algorithms. Proc. 11th European Conf. Machine Learning. Lecture Notes in Computer Science 1810, pp. 413\u2013425. Springer.","DOI":"10.1007\/3-540-45164-1_42"},{"key":"2016033018434745000_bxw015v1.15","doi-asserted-by":"crossref","unstructured":"N\u00fanez M. (1991) The Use of Background Knowledge in Decision Tree Induction. Machine Learning 6, pp. 231\u2013250. Kluwer Academic Publishers, Boston.","DOI":"10.1007\/BF00114778"},{"key":"2016033018434745000_bxw015v1.16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00993101","article-title":"Cost-sensitive learning of classification knowledge and its applications in robotics","volume":"13","author":"Tan","year":"1993","journal-title":"Mach. Learn."},{"key":"2016033018434745000_bxw015v1.17","doi-asserted-by":"crossref","unstructured":"Tan M. and Schlimmer J. (1989) Cost-Sensitive Concept Learning of Sensor use in Approach and Recognition. Proc. 6th Int. Workshop on Machine Learning (ML'89), pp. 392\u2013395.","DOI":"10.1016\/B978-1-55860-036-2.50099-0"},{"key":"2016033018434745000_bxw015v1.18","unstructured":"Norton S.W. (1989) Generating Better Decision Trees. Proc. 11th Int. Joint Conf. Artificial Intelligence (IJCAI'89), pp. 800\u2013805."},{"key":"2016033018434745000_bxw015v1.19","doi-asserted-by":"crossref","unstructured":"Domingos P. (1999) MetaCost: A General Method for Making Classifiers Cost-sensitive. Proc. 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp. 155\u2013164. ACM, New York, NY, USA.","DOI":"10.1145\/312129.312220"},{"key":"2016033018434745000_bxw015v1.20","unstructured":"Fan W. , Stolfo S.J. , Zhang J. and Chan P.K. (1999) AdaCost: Misclassification Cost-sensitive Boosting. 16th Int. Conf. Machine Learning, Bled, Slovenia, June 27\u201330, pp. 97\u2013105."},{"key":"2016033018434745000_bxw015v1.21","doi-asserted-by":"publisher","DOI":"10.1016\/S1566-2535(02)00100-8"},{"key":"2016033018434745000_bxw015v1.22","doi-asserted-by":"crossref","unstructured":"Esmeir S. and Markovitch S. (2004) Lookahead-based Algorithms for Anytime Induction of Decision Trees. In Brodley, C.E. (ed.), Proc. 21st Int. Conf. Machine Learning (ICML'04), pp. 257\u2013264.","DOI":"10.1145\/1015330.1015373"},{"key":"2016033018434745000_bxw015v1.23","doi-asserted-by":"publisher","DOI":"10.1080\/08839519508945477"},{"key":"2016033018434745000_bxw015v1.24","unstructured":"Abdelmessih S.D. , Shafait F. , Reif M. and Goldstein M. (2010) Landmarking for Meta-learning using RapidMiner. German Research Center for Artificial Intelligence, Germany. http:\/\/www.mendeley.com\/research\/landmarking-metalearning-using-rapidminer (accessed January 24, 2014)."},{"key":"2016033018434745000_bxw015v1.25","doi-asserted-by":"crossref","unstructured":"Bensusan H. and Giraud-Carrier C. (2000) Discovering Task Neighbourhoods through Landmark Learning Performances. Principles of Data Mining and Knowledge Discovery. Lecture Notes in Computer Science 1910, pp. 325\u2013330. Springer, Berlin, Heidelberg.","DOI":"10.1007\/3-540-45372-5_32"},{"key":"2016033018434745000_bxw015v1.26","doi-asserted-by":"crossref","unstructured":"Shilbayeh S.A. and Vadera S. (2014) Feature Selection in Meta Learning Framework. Proc. Science and Information Conf., London (to appear in August 2014).","DOI":"10.1109\/SAI.2014.6918200"},{"key":"2016033018434745000_bxw015v1.27","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi N. and Lugosi G. (2006) Prediction, Learning and Games. Cambridge University Press, New York.","DOI":"10.1017\/CBO9780511546921"},{"key":"2016033018434745000_bxw015v1.28","unstructured":"Davis M.D. (1983) Game Theory a Nontechnical Introduction. Dover Publications, Inc., Mineola, NY, USA."},{"key":"2016033018434745000_bxw015v1.29","unstructured":"Osborne M.J. (2004) An Introduction to Game Theory. Oxford University Press, New York, USA."},{"key":"2016033018434745000_bxw015v1.30","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"2016033018434745000_bxw015v1.31","unstructured":"Nash J.F. (1950) Non-cooperative games. Doctoral Dissertation, Princeton University, reprinted in The Essential John Nash (Kuhn, H.W. and Nasar, S. (eds), pp. 53\u201384). Princeton University Press, 2002."},{"key":"2016033018434745000_bxw015v1.32","unstructured":"Von Neumann J. and Morgenstern O. (1953) The Theory of Games and Economic Behaviour (3rd edn). Princeton University Press, Princeton, USA."},{"key":"2016033018434745000_bxw015v1.33","unstructured":"Rasmusen E. (2001) Games and Information an Introduction to Game Theory (3rd edn). Blackwell Publishers Ltd, Oxford, UK."},{"key":"2016033018434745000_bxw015v1.34","doi-asserted-by":"crossref","unstructured":"Ling C.X. , Yang Q. , Wang J. and Zhang S. (2004) Decision Trees with Minimal Costs. ACM Int. Conf. Proc. Series 21st Int. Conf. Machine Learning, Banff, Alberta, Canada. ACM Press, New York, NY, USA. Article No. 69, ISBN: 1-58113- 828-5.","DOI":"10.1145\/1015330.1015369"},{"key":"2016033018434745000_bxw015v1.35","doi-asserted-by":"crossref","unstructured":"Ting K. and Zheng Z. (1998) Boosting Cost-sensitive Trees. Proc. 1st Int. Conf. Discovery Science. LNCS 1532, pp. 244\u2013255. Springer, London.","DOI":"10.1007\/3-540-49292-5_22"},{"key":"2016033018434745000_bxw015v1.36","doi-asserted-by":"crossref","unstructured":"Ting K.M. and Zheng Z. (1998) Boosting Trees for Cost-sensitive Classifications. Machine Learning: ECML-98 10th European Conf. Machine Learning, Chemnitz, Germany, pp. 190\u2013195. Springer, Berlin, Heidelberg, New York.","DOI":"10.1007\/BFb0026689"},{"key":"2016033018434745000_bxw015v1.37","unstructured":"Zadrozny B. , Langford J. and Abe N. (2003) A simple method for cost-sensitive learning. Technical Report RC22666, IBM, 2003. http:\/\/citeseer.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.7.7947 (accessed March 17, 2016)."},{"key":"2016033018434745000_bxw015v1.38","doi-asserted-by":"crossref","unstructured":"Zadrozny B. , Langford J. and Abe N. (2003) Cost-sensitive Learning by Cost-proportionate Example Weighting. Third IEEE Int. Conf. Data Mining, Melbourne, FL, USA, November 19\u201322, p. 435.","DOI":"10.1109\/ICDM.2003.1250950"},{"key":"2016033018434745000_bxw015v1.39","doi-asserted-by":"crossref","unstructured":"Binmore K. (2007) Game Theory a Very Short Introduction. Oxford University Press Inc, New York.","DOI":"10.1093\/actrade\/9780199218462.001.0001"},{"key":"2016033018434745000_bxw015v1.40","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","article-title":"Some aspects of the sequential design of experiments","volume":"55","author":"Robbins","year":"1952","journal-title":"Bull. Am. Math. Soc."},{"key":"2016033018434745000_bxw015v1.41","unstructured":"Auer P. , Cesa-Bianchi N. , Freud Y. and Schapire R.E. (2001) The non-stochastic multi-armed bandit problem. http:\/\/cseweb.ucsd.edu\/~yfreund\/papers\/bandits.pdf (accessed April 23, 2013)."},{"key":"2016033018434745000_bxw015v1.42","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"2016033018434745000_bxw015v1.43","doi-asserted-by":"crossref","unstructured":"Auer P. , Cesa-Bianchi N. , Freud Y. and Schapire R.E. (1995) Gambling in a rigged casino: the adversarial multi-armed bandit problem. Internal Report 223-98, DSI, Universit\u00e0 di Milano, Italy, Foundations of Computer Science, Proceedings of 36th Annual Symposium, October 23\u201325, Milwaukee, USA, pp. 322\u2013331.","DOI":"10.1109\/SFCS.1995.492488"},{"key":"2016033018434745000_bxw015v1.44","doi-asserted-by":"crossref","unstructured":"Berry D.A. and Fristedt B. (1985) Bandit Problems: Sequential Allocation of Experiments. Monographs on Statistics and Applied Probability, London: Chapman & Hall. ISBN 0-412-24810-7","DOI":"10.1007\/978-94-015-3711-7"},{"key":"2016033018434745000_bxw015v1.45","unstructured":"Dorard L. and Shawe-Taylor J. (2010) Gaussian Process Bandits for Tree Search. University College London. http:\/\/ucl.academia.edu\/LouisDorard\/Papers\/273653\/Gaussian_Process_Bandits_for_Tree_Search (accessed February 8, 2011)."},{"key":"2016033018434745000_bxw015v1.46","unstructured":"Dorard L. , Glowacka D. and Shawe-Taylor J. (2009) Gaussian Process Modelling of Dependencies in Multi-armed Bandit Problems. Proc. 10th Int. Symp. Operational Research (SOR), September 23\u201325, Nova Gorica, Slovenia."},{"key":"2016033018434745000_bxw015v1.47","unstructured":"Gittins J.C. (1989) Multi-armed Bandit Allocation Indices. Wiley-Interscience Series in Systems and Optimization. John Wiley & Sons, Ltd, Chichester. ISBN 0-471-92059-2"},{"key":"2016033018434745000_bxw015v1.48","unstructured":"Gr\u00fcnew\u00e4lder S. , Audibert J.-Y. , Opper M. and Shawe-Taylor J. (2010) Regret Bounds for Gaussian Process Bandit Problems. Proc. 13th Int. Conf. Artificial Intelligence and Statistics, JMLR 9, Chia Laguna Resort, Sardinia, Italy."},{"key":"2016033018434745000_bxw015v1.49","doi-asserted-by":"crossref","unstructured":"Vermorel J. and Mohri M. (2005) Multi-armed Bandit Algorithms and Empirical Evaluation. 16th Eur. Conf. Machine Learning (ECML), Porto, Portugal, October 3\u20137, Vol. 3720, pp. 437\u2013448. Springer.","DOI":"10.1007\/11564096_42"},{"key":"2016033018434745000_bxw015v1.50","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume":"3","author":"Auer","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"2016033018434745000_bxw015v1.51","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor J. (2010) Multivariate Bandits and their Applications. Intelligent Information Processing, IIP, Presentation Slides, October 15, held at Lowry Centre, Salford.","DOI":"10.1007\/978-3-642-16327-2_3"},{"key":"2016033018434745000_bxw015v1.52","doi-asserted-by":"crossref","unstructured":"Bubeck S. , Munos R. and Stoltz G. (2009) Pure exploration in multi-armed bandit problems. Algorithmic Learning. Lecture Notes in Computer Science 5809, pp. 23\u201337.","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"2016033018434745000_bxw015v1.53","unstructured":"Audibert J.Y. and Bubeck S. (2010) Best Arm Identification in Multi-armed Bandits. COLT-23th Conf. Learning Theory-2010, Haifa, Israel, Jun 2010, p. 13."},{"key":"2016033018434745000_bxw015v1.54","first-page":"3212","article-title":"Best arm identification: a unified approach to fixed budget and fixed confidence","volume":"25","author":"Gabillon","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2016033018434745000_bxw015v1.55","unstructured":"Watkins C.J.C.H. (1989) Learning from delayed rewards. PhD Thesis, Cambridge University."},{"key":"2016033018434745000_bxw015v1.56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2602","article-title":"Anytime induction of low-cost, low-error classifiers: a sampling-based approach","volume":"33","author":"Esmeir","year":"2008","journal-title":"J. Artif. Intell. Res."},{"key":"2016033018434745000_bxw015v1.57","unstructured":"Lomax S. (2013) Cost-sensitive decision tree learning using a multi-armed bandit framework. PhD Thesis, University of Salford."},{"key":"2016033018434745000_bxw015v1.58","doi-asserted-by":"crossref","unstructured":"Lomax S. , Vadera S. and Saraee M. (2012) A Multi-armed Bandit Approach to Cost-sensitive Decision Tree Learning. 2012 IEEE 12th Int. Conf. Data Mining Workshops (ICDMW), Brussels, Belgium, December 10\u201313, pp. 162\u2013168.","DOI":"10.1109\/ICDMW.2012.33"},{"key":"2016033018434745000_bxw015v1.59","unstructured":"Freund Y. and Schapire R.E. (1996) Experiments with a New Boosting Algorithm. 13th Int. Conf. Machine Learning, San Francisco, USA, pp. 148\u2013156."},{"key":"2016033018434745000_bxw015v1.60","unstructured":"Vadera S. and Ventura D. (2001) A Comparison of Cost-sensitive Decision Tree Learning Algorithms. The 2nd European Conf. Intelligent Management Systems in Operations, July 3\u20134, pp. 79\u201386. University of Salford, Operational Research Society, Birmingham, UK."},{"key":"2016033018434745000_bxw015v1.61","unstructured":"Bache K. and Lichman M. (2013) UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA. http:\/\/archive.ics.uci.edu\/ml (accessed March 17, 2016)."},{"key":"2016033018434745000_bxw015v1.62","doi-asserted-by":"crossref","unstructured":"Aodha O.M. and Brostow G.J. (2013) Revisiting Example Dependent Cost-sensitive Learning with Decision Trees. Proc. IEEE Int. Conf. Computer Vision, Washington, DC, USA, pp. 193\u2013200.","DOI":"10.1109\/ICCV.2013.31"},{"key":"2016033018434745000_bxw015v1.63","doi-asserted-by":"crossref","unstructured":"Bahnsen A.C. , Aouada D. and Ottersten B. (2015) Example-dependent cost-sensitive decision trees. Expert Syst. Appl. in press. http:\/\/dx.doi.org\/10.1016\/j.eswa.2015.04.042 .","DOI":"10.1016\/j.eswa.2015.04.042"},{"key":"2016033018434745000_bxw015v1.64","doi-asserted-by":"crossref","unstructured":"Even-Dar E. , Mannor S. and Mansour Y. (2002) PAC Bounds for Multi-arm Bandits and Markov Decision Processes. 15th Annual Conf. Computational Learning Theory (COLT), pp. 255\u2013270.","DOI":"10.1007\/3-540-45435-7_18"},{"key":"2016033018434745000_bxw015v1.65","unstructured":"Fern A. (n.d.) Monte-Carlo Planning: Introduction and Bandit Basics. http:\/\/web.engr.oregonstate.edu\/mcai\/mc_plan_library\/mcp-bandits.pdf (accessed November 1, 2015)."},{"key":"2016033018434745000_bxw015v1.66","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753344605"},{"key":"2016033018434745000_bxw015v1.67","unstructured":"Pichuka C. , Bapi R.S. , Bhagvati C. , Pujari A.K. and Dheekshatulu B.L. (1997) A Tighter Bound for Decision Tree Learning using PAC Learnability. Proc. 15th Int. Joint Conf. AI (IJCAI), pp. 1011\u20131016."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/60\/7\/941\/18529380\/bxw015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T23:45:45Z","timestamp":1567727145000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,30]]},"references-count":67,"alternative-id":["10.1093\/comjnl\/bxw015"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw015","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,30]]}}}