{"type":"ScholarlyArticle","title":"Ranking Cases with Decision Trees: a Geometric Method that Preserves Intelligibility","authors":[{"name":"Isabelle Alvarez","slug":"isabelle-alvarez","given":"Isabelle","family":"Alvarez","affiliation":"( ) LIP6 , Paris VI University 4 place Jussieu , F-75005 Paris , France; ( ) (; ) Cemagref , LISC F-63172 Aubiere Cedex , France"},{"name":"Stephan Bernard","slug":"stephan-bernard","given":"Stephan","family":"Bernard","affiliation":""}],"abstract":"This paper proposes a new method to rank the cases classified by a decision tree. The method applies a posteriori without modification of the tree and doesn’t use additional training cases. It consists in computing the distance of the cases to the decision boundary induced by the decision tree, and to rank them according to this geometric score. When the data are numeric it is very easy to implement and efficient. The distance-based score is a global assess, contrary to other methods that evaluate the score at the level of the leaf. The distance-based score gives good results even with pruned tree, so if the tree is intelligible this property is preserved with an improved ranking ability. The main reason for the efficacity of the geometric method is that in most cases when the classifier is sufficiently accurate, errors are located near the decision boundary.","doi":null,"url":"https://ijcai.org/proceedings/2005/195","pdf":"https://ijcai.org/proceedings/2005/0195.pdf","markdown":"https://ijcai.org/proceedings/2005/195.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/195","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":195,"pages":{"first":635,"last":639},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Adams and Hand, 1999] N. M. Adams and D. J. Hand. Comparing classifiers when the misallocation costs are un- certain. Pattern Recognition, 32(7):1139-1147, 1999.","title":"Comparing classifiers when the misallocation costs are uncertain","authors":"N M Adams, D J Hand","year":"1999","venue":"Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alvarez, 2004] Isabelle Alvarez. Explaining the result of a decision tree to the end-user. In Proceedings of the 16th European Conference on Artificial Intelligence, pages 119-128, Valencia, Spain, Aout 2004.","title":"Explaining the result of a decision tree to the end-user","authors":"Isabelle Alvarez","year":"2004","venue":"Proceedings of the 16th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Morgan Kaufmann.","title":null,"authors":"Morgan Kaufmann","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Blake and Merz, 1998] C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.","title":"UCI repository of machine learning databases","authors":"C L Blake, C J Merz","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bradley and Lovell, 1995] Andrew P. Bradley and Brian C. Lovell. Cost-sensitive decision tree pruning: Use of the roc curve. In Eighth Australian Joint Conference on Artificial Intelligence, pages 1-8, 1995.","title":"Cost-sensitive decision tree pruning: Use of the roc curve","authors":"Andrew P Bradley, Brian C Lovell","year":"1995","venue":"Eighth Australian Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Breiman et al., 1984] L. Breiman, J. H. Friedman, R. A. Ol- shen, and C. J. Stone. Classification and Regression Trees. Wadsworth, Belmont, 1984.","title":"Classification and Regression Trees","authors":"L Breiman, J H Friedman, R A Olshen, C J Stone","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cestnik, 1990] B. Cestnik. Estimating probabilities: A cru- cial task in machine learning. In Proceedings of the Euro- pean Conference on Artificial Intelligence, pages 147-149, 1990.","title":"Estimating probabilities: A crucial task in machine learning","authors":"B Cestnik","year":"1990","venue":"Proceedings of the European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Esposito et al., 1997] F. Esposito, D. Malerba, and G. Se- meraro. A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):476-491, 1997.","title":"A comparative analysis of methods for pruning decision trees","authors":"F Esposito, D Malerba, G Semeraro","year":"1997","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kohavi, 1996] Ron Kohavi. Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. In Proceed- ings of the Second International Conference on Knowl- edge Discovery and Data Mining, pages 202-207, 1996.","title":"Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid","authors":"Ron Kohavi","year":"1996","venue":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ling and Yan, 2003] C. X. Ling and R. J. Yan. Decision tree with better ranking. In Proceedings of the 20th Interna- tional Conference on Machine Learning, pages 480-487, 2003.","title":"Decision tree with better ranking","authors":"C X Ling, R J Yan","year":"2003","venue":"Proceedings of the 20th International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Murthy, 1998] S.K. Murthy. A automatic construction of decision trees from data: A multi-disciplinary survey. Data Mining and Knowledge Discovery, 2(4):345-389, 1998.","title":"A automatic construction of decision trees from data: A multi-disciplinary survey","authors":"S K Murthy","year":"1998","venue":"Data Mining and Knowledge Discovery","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Platt, 2000] J. Platt. Probabilistic outputs for support vec- tor machines. In Bartlett P. Schoelkopf B. Schuurmans D. Smola, A.J., editor, Advances in Large Margin Classi- fiers, pages 61-74, Cambridge, Massachusetts, 2000. MIT Press.","title":"Probabilistic outputs for support vector machines","authors":"J Platt","year":"2000","venue":"Advances in Large Margin Classifiers","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Provost and Domingos, 2003] F. Provost and P. Domingos. Tree induction for probability-based ranking. Machine Learning, 52(3):199-215, 2003.","title":"Tree induction for probability-based ranking","authors":"F Provost, P Domingos","year":"2003","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Quinlan, 1993] J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, 1993.","title":"C4.5: Programs for Machine Learning","authors":"J R Quinlan","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Smyth et al., 1995] Padhraic Smyth, Alexander Gray, and Usama M. Fayyad. Retrofitting decision tree classifiers us- ing kernel density estimation. In International Conference on Machine Learning, pages 506-514, 1995.","title":"Retrofitting decision tree classifiers using kernel density estimation","authors":"Padhraic Smyth, Alexander Gray, Usama M Fayyad","year":"1995","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Umano et al., 1994] M. Umano, K. Okomato, I. Hatono, H. Tamura, F. Kawachi, S. Umezu, and J. Kinoshita. Fuzzy decision trees by fuzzy id3 algorithm and its application to diagnosis systems. In 3rd IEEE International Conference on Fuzzy Systems, pages 2113-2118, 1994.","title":"Fuzzy decision trees by fuzzy id3 algorithm and its application to diagnosis systems","authors":"M Umano, K Okomato, I Hatono, H Tamura, F Kawachi, S Umezu, J Kinoshita","year":"1994","venue":"3rd IEEE International Conference on Fuzzy Systems","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Witten and Frank, 2000] I. Witten and E. Frank. Data Min- ing: Practical Machine Learning Tools and Techniques with Java Implementation. Morgan Kaufmann, 2000.","title":"Data Mining: Practical Machine Learning Tools and Techniques with Java Implementation","authors":"Frank ; Witten, I Witten, E Frank","year":"2000","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Zadrozny and Elkan, 2001] Bianca Zadrozny and Charles Elkan. Obtaining calibrated probability estimates from de- cision trees and naive bayesian classifiers. In Proc. 18th International Conf. on Machine Learning, pages 609-616.","title":"Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers","authors":"Elkan Zadrozny, Bianca Zadrozny, Charles Elkan","year":"2001","venue":"Proc. 18th International Conf. on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"Morgan Kaufmann, 2001.","title":null,"authors":"Morgan Kaufmann","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}