Sensitivity Analysis of the Result in Binary Decision Trees
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 different 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.
Cite
Text
Alvarez. "Sensitivity Analysis of the Result in Binary Decision Trees." European Conference on Machine Learning, 2004. doi:10.1007/978-3-540-30115-8_8Markdown
[Alvarez. "Sensitivity Analysis of the Result in Binary Decision Trees." European Conference on Machine Learning, 2004.](https://mlanthology.org/ecmlpkdd/2004/alvarez2004ecml-sensitivity/) doi:10.1007/978-3-540-30115-8_8BibTeX
@inproceedings{alvarez2004ecml-sensitivity,
title = {{Sensitivity Analysis of the Result in Binary Decision Trees}},
author = {Alvarez, Isabelle},
booktitle = {European Conference on Machine Learning},
year = {2004},
pages = {51-62},
doi = {10.1007/978-3-540-30115-8_8},
url = {https://mlanthology.org/ecmlpkdd/2004/alvarez2004ecml-sensitivity/}
}