Title :
Designing storage efficient decision trees
Author :
Murphy, O.J. ; McCraw, R.L.
Author_Institution :
Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA
fDate :
3/1/1991 12:00:00 AM
Abstract :
The problem of designing storage-efficient decision trees from decision tables is examined. It is shown that for most cases, the construction of the storage optimal decision tree is an NP-complete problem, and therefore a heuristic approach to the problem is necessary. A systematic procedure analogous to the information-theoretic heuristic is developed. The algorithm has low computational complexity and performs well experimentally
Keywords :
computational complexity; data structures; decision tables; decision theory; trees (mathematics); NP-complete problem; computational complexity; decision tables; information-theoretic heuristic; storage efficient decision trees; storage optimal decision tree; Algorithm design and analysis; Artificial intelligence; Computational complexity; Decision trees; Medical diagnosis; NP-complete problem; Pattern recognition; Quality control; Testing; Tree graphs;
Journal_Title :
Computers, IEEE Transactions on
