Decision Trees for Instance Transfer

Author(s):  
Shuang Zhou ◽  
Evgueni Smirnov ◽  
Gijs Schoenmakers ◽  
Ralf Peeters
Keyword(s):  
1999 ◽  
Vol 38 (01) ◽  
pp. 50-55 ◽  
Author(s):  
P. F. de Vries Robbé ◽  
A. L. M. Verbeek ◽  
J. L. Severens

Abstract:The problem of deciding the optimal sequence of diagnostic tests can be structured in decision trees, but unmanageable bushy decision trees result when the sequence of two or more tests is investigated. Most modelling techniques include tests on the basis of gain in certainty. The aim of this study was to explore a model for optimizing the sequence of diagnostic tests based on efficiency criteria. The probability modifying plot shows, when in a specific test sequence further testing is redundant and which costs are involved. In this way different sequences can be compared. The model is illustrated with data on urinary tract infection. The sequence of diagnostic tests was optimized on the basis of efficiency, which was either defined as the test sequence with the least number of tests or the least total cost for testing. Further research on the model is needed to handle current limitations.


1986 ◽  
Vol 25 (04) ◽  
pp. 207-214 ◽  
Author(s):  
P. Glasziou

SummaryThe development of investigative strategies by decision analysis has been achieved by explicitly drawing the decision tree, either by hand or on computer. This paper discusses the feasibility of automatically generating and analysing decision trees from a description of the investigations and the treatment problem. The investigation of cholestatic jaundice is used to illustrate the technique.Methods to decrease the number of calculations required are presented. It is shown that this method makes practical the simultaneous study of at least half a dozen investigations. However, some new problems arise due to the possible complexity of the resulting optimal strategy. If protocol errors and delays due to testing are considered, simpler strategies become desirable. Generation and assessment of these simpler strategies are discussed with examples.


1998 ◽  
Vol 37 (03) ◽  
pp. 235-238 ◽  
Author(s):  
M. El-Taha ◽  
D. E. Clark

AbstractA Logistic-Normal random variable (Y) is obtained from a Normal random variable (X) by the relation Y = (ex)/(1 + ex). In Monte-Carlo analysis of decision trees, Logistic-Normal random variates may be used to model the branching probabilities. In some cases, the probabilities to be modeled may not be independent, and a method for generating correlated Logistic-Normal random variates would be useful. A technique for generating correlated Normal random variates has been previously described. Using Taylor Series approximations and the algebraic definitions of variance and covariance, we describe methods for estimating the means, variances, and covariances of Normal random variates which, after translation using the above formula, will result in Logistic-Normal random variates having approximately the desired means, variances, and covariances. Multiple simulations of the method using the Mathematica computer algebra system show satisfactory agreement with the theoretical results.


Author(s):  
L. R. Bahl ◽  
P. V. de Soutza ◽  
P. S. Gopalakrishnan ◽  
D. Nahamoo ◽  
M. A. Picheny

1991 ◽  
Author(s):  
Jerry M. Linenger ◽  
William B. Long ◽  
William J. Sacco

Sign in / Sign up

Export Citation Format

Share Document