|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| O.J. Murphy, R.L. McCraw, "Designing Storage Efficient Decision Trees," IEEE Transactions on Computers, vol. 40, no. 3, pp. 315-320, March, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/12.76408, author = {O.J. Murphy and R.L. McCraw}, title = {Designing Storage Efficient Decision Trees}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {3}, issn = {0018-9340}, year = {1991}, pages = {315-320}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.76408}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Designing Storage Efficient Decision Trees IS - 3 SN - 0018-9340 SP315 EP320 EPD - 315-320 A1 - O.J. Murphy, A1 - R.L. McCraw, PY - 1991 KW - 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). VL - 40 JA - IEEE Transactions on Computers ER - | |||
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.
[1] D. Comer and R. Sethi, "The complexity of trie index construction,"J. ACM, vol. 24, pp. 428-440, 1977.
[2] C. R. P. Hartmann, P. K. Varshney, K. G. Mehrotra, and C. L. Gerberich, "Application of information theory to the construction of efficient decision trees,"IEEE Trans. Inform. Theory, vol. IT-28, pp. 565-577, July 1982.
[3] L. Hyafil and R. L. Rivest, "Constructing optimal binary decision trees is NP-complete,"Inform. Processing Lett., vol. 5, pp. 15-17, 1976.
[4] B. M. E. Moret, "Decision trees and diagrams,"Comput. Surveys, vol. 14, no. 4, pp. 593-623, 1982.
[5] R. W. Payne and D. A. Preece, "Identification keys and diagnostic tables: A review,"J. Royal Stat. Soc. (Series A), vol. 143, pp. 253-259, 1980.
[6] S. L. Pollack, "Conversion of limited-entry decision tables to computer programs,"Commun. ACM, vol. 11, pp. 677-682, Nov. 1965.
[7] L. I. Press, "Conversion of decision tables to computer programs,"Commun. ACM, vol. 8, pp. 385-390, 1965.
[8] L. T. Reinwald and R. M. Soland, "Conversion of limited-entry decision tables to optimal computer programs II: Minimum storage requirement,"J. ACM, vol. 14, pp. 742-755, Oct. 1967.