DocumentCode
2690313
Title
A hill-climbing approach to construct near-optimal decision trees
Author
Sun, Xiaorong ; Qiu, Yuping ; Cox, L.A.
Author_Institution
US West Technol., Boulder, CO, USA
Volume
2
fYear
1994
fDate
2-5 Oct 1994
Firstpage
1246
Abstract
We consider the problem of identifying the state of an n component coherent system, where each component can be working or failed. It is costly to determine the states of the components. The goal is to find a decision tree which specifies the order of the components to be tested with minimum expected cost. The problem is known to be NP-hard. We present an extremely promising heuristic method for creating effective decision trees, and computational results show that the method obtains optimal solutions for 95% of the cases tested
Keywords
computational complexity; decision theory; failure analysis; heuristic programming; optimisation; state estimation; trees (mathematics); NP-hard problem; failure analysis; heuristic method; hill-climbing approach; minimum expected cost; multicomponent coherent system; near-optimal decision tree construction; state identification; Binary trees; Costs; Decision trees; Drives; Inspection; Random variables; Sun; System testing; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-2129-4
Type
conf
DOI
10.1109/ICSMC.1994.400016
Filename
400016
Link To Document