Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ECML
2004
Springer

favoriteEmaildiscussreport

91views Machine Learning» more ECML 2004»

Sensitivity Analysis of the Result in Binary Decision Trees

13 years 9 months ago

Sensitivity Analysis of the Result in Binary Decision Trees

Download www-poleia.lip6.fr

This paper 3 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 order to provide a context-dependent information to the end-user.

Isabelle Alvarez

Real-time Traffic

Decision Aid System | Decision Surface | Decision Tree | ECML 2004 |

claim paper

Related Content

» Decision trees for entity identification approximation algorithms and hardness results

» Explaining the Result of a Decision Tree to the EndUser

» Cache Conscious Indexing for DecisionSupport in Main Memory

» An Efficient BinaryDecisionDiagramBased Approach for Network Reliability and Sensitivity A...

» Cloningbased contextsensitive pointer alias analysis using binary decision diagrams

» Towards scalable flow and context sensitive pointer analysis

» A Sensitivity Analysis for the Pricing of European Call Options in a Binary Tree Model

» Traffic Accident Analysis Using Decision Trees and Neural Networks

» Decision Trees Using the Minimum EntropyofError Principle

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ECML
Authors	Isabelle Alvarez

Comments (0)