Isabelle Alvarez  Home/Search
Context
Related
| poleia.lip6.fr/%7E...nsitivityFinal.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: poleia.lip6.fr/%7Eia/pre...publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper proposes a new method to qualify the result given by a decision tree when it is used as a decision aid system. When the data are numerical, we compute the distance of a case from the decision surface. This distance measures the sensitivity of the result to a change in the input data. With a di#erent distance it is also possible to measure the sensitivity of the result to small changes in the tree. The distance from the decision surface can also be combined to the error rate in... (Update)
Active bibliography (related documents): More All
0.5: A Fuzzy Beam-Search Rule Induction Algorithm - Fertig, Freitas, Arruda, Kaestner (1999) (Correct)
0.5: Two Constructive Methods for Designing Compact Feedforward.. - Amaldi, al. (1998) (Correct)
0.3: Neural Networks in Business: Techniques and Applications for.. - Smith, Gupta (2000) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ alvarez-sensitivity,
author = "Isabelle Alvarez",
title = "Sensitivity Analysis of the Result in Binary Decision Trees",
url = "citeseer.ist.psu.edu/alvarez04sensitivity.html" }
Citations (may not include all citations):2177 Programs for Machine Learning (context) - Quinlan - 1993
1262 Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
472 Hierarchical mixtures of experts and the EM algorithm - Jordan, Jacobs - 1994
431 A tutorial on support vector machines for pattern recognitio.. - Burges - 1998
262 Data Mining: Practical Machine Learning Tools and Techniques.. (context) - Witten, Frank - 2000
164 A study of cross-validation and bootstrap for accuracy estim.. - Kohavi - 1995
105 Estimating probabilities: A crucial task in machine learning (context) - Cestnik - 1990
85 Analysis and visualization of classifier performance: Compar.. - Provost, Fawcett - 1997
46 MetaCost: A General Method for Making Classifiers Cost-Sensi.. - Domingos - 1999
43 Algorithmic stability and sanity-check bounds for leaveone -.. - Kearns, Ron - 1997
40 Scaling Up the Accuracy of Naive-Bayes Classifiers: a Decisi.. - Kohavi - 1996
38 Automatic Construction of Decision Trees from Data: A MultiD.. - Murthy - 1998
37 On projection algorithms for solving convex feasibility prob.. - Bauschke, Borwein - 1996
23 Obtaining calibrated probability estimates from decision tre.. - Zadrozny, Elkan - 2001
16 A comparative analysis of methods for pruning decision trees - Esposito, Malerba et al. - 1997
10 Well-trained PETs: Improving probability estimation trees - Domingos, Provost - 2000
9 A Unified Bias-Variance Decomposition and its Applications - Domingos - 2000
3 Neural network credit scoring models (context) - West - 2000
2 UCI Repository of machine learning databases (context) - Sigillito, Blake et al. - 1990
2 Optimal decision trees - Bennett, Blue - 1996
1 Recursive Partitioning for the Identification of Disease Ris.. (context) - Nelson, Bloch et al. - 1998
1 Probabilistic outputs for support vector machines (context) - Platt - 2000
1 rd IEEE Int (context) - Umano, Okomato et al. - 1994
Documents on the same site (http://www-poleia.lip6.fr/%7Eia/presentation/publis.html):
Explaining the result of a Decision Tree to the End-User - Isabelle Alvar Ez (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC