Sciweavers

284 search results - page 1 / 57
» Sensitivity Analysis of the Result in Binary Decision Trees
Sort
View
ECML
2004
Springer
13 years 10 months ago
Sensitivity Analysis of the Result in Binary Decision Trees
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 ...
Isabelle Alvarez
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 4 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
ECAI
2004
Springer
13 years 10 months ago
Explaining the Result of a Decision Tree to the End-User
This paper addresses the problem of the explanation of the result given by a decision tree, when it is used to predict the class of new cases. In order to evaluate this result, the...
Isabelle Alvarez
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 9 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
TSMC
2008
119views more  TSMC 2008»
13 years 4 months ago
An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis
Abstract--Reliability and sensitivity analysis is a key component in the design, tuning, and maintenance of network systems. Tremendous research efforts have been expended in this ...
Liudong Xing