Issue No. 03 - March (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.76408
<p>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.</p>
storage efficient decision trees; decision tables; storage optimal decision tree; NP-complete problem; information-theoretic heuristic; computational complexity; computational complexity; data structures; decision tables; decision theory; trees (mathematics).
O.J. Murphy, R.L. McCraw, "Designing Storage Efficient Decision Trees", IEEE Transactions on Computers, vol. 40, no. , pp. 315-320, March 1991, doi:10.1109/12.76408