Criteria for Selecting a Variable in the Construction of Efficient Decision Trees

IEEE Transactions on Computers

Volumn 38, Issue 1, 1989, Pages 130-141

  Miyakawa, Masahiro ^a  

^a Electrotechmcal Laboratory ^*  (Japan)

Author keywords

Database searching; decision table; decision tree; diagnosis; identification of a specimen; multiple valued logic function; optimization; optimum tree; pattern recognition; program optimization; sequential testing procedure

Indexed keywords

COMPUTER METATHEORY--MANY VALUED LOGICS; DECISION THEORY AND ANALYSIS; MATHEMATICAL TECHNIQUES--HEURISTIC; PATTERN RECOGNITION;

DATABASE SEARCHING; DECISION TREES; OPTIMUM TREE; SEQUENTIAL TESTING PROCEDURE;

DATABASE SYSTEMS;

EID: 0024480143     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.8736     Document Type: Article

References (18)

1. A.J. Bayes, “A dynamic programming algorithm to optimise decision table code,” Australian Comput. J., vol. 5, pp. 77–79, May 1973.
2. M.R. Garey, “Simple binary identification problems,” IEEE Trans. Comput., vol. C-21, pp. 588–590, June 1972.
3. S. Ganapathy and V. Rajaraman, “Information theory applied to the conversion of decision tables to computer programs,” Commun. ACM, vol. 16, 9, pp. 532–539, Sept. 1973.
4. M.Z. Hanani, “An optimal evaluation of Boolean expressions in an online query system,” Commun. ACM, vol. 20, pp. 344–347, May 1977.
5. C.R.P. Hartman, 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.
6. L. Hyafil and R.L. Rivest, “Constructing optimal binary decision trees is NP-complete,” Commun. ACM, vol. 5, pp. 15–17, May 1976.
7. D.E. Knuth, The Art of Computer Programming, Vol. 1, 2nd ed. Reading, MA: Addison-Wesley, 1973.
8. D.E. Knuth, The Art of Computer Programming, Vol. 3. Reading, MA: Addison-Wesley, 1973.
9. M. Miyakawa and V.K. Sabelfeld, “On minimizations of size of logical schemes (in Russian),” Theoretical basis of compiling, A.P. Ershov, Ed. pp. 49–58, Novosibirsk State University, Novosibirsk 1980.
10. M. Miyakawa and N. Otsu, “Algorithms constructing near-minimum total nodes decision trees from expanded decision tables (in Japanese), “TGEC IECE Japan, EC82–33, July 1982.
11. M. Miyakawa, “Optimum decision trees-An optimal variable theorem and its related applications,” Acta Informatica, vol. 22, pp. 475–498, 1985.
12. B.M.E. Moret, M.G. Thomason, and R.C. Gonzalez, “The activity of a variable and its relation to decision table,” ACM Trans. Programming Languages Syst., vol. 2, pp. 580–595, Oct. 1980.
13. B.M.E. Moret, “Decision trees and diagrams,” Comput. Surveys, vol. 14, pp. 593–623, Dec. 1982.
14. L.T. Reinwald and R.M. Soland, “Conversion of limited-entry decision tables to optimal computer programs I: Minimum average processing time,” J. ACM, vol. 13, pp. 339–358, July 1966.
15. L.T. Reinwald, “Conversion of limited-entry decision tables to optimal computer programs II: Minimum storage requirement,” J. ACM, vol. 14, pp. 742–755, Oct. 1967.
16. H. Schumacher and K. Sevcik, “The synthetic approach to decision table conversion,” Commun. ACM, vol. 19, pp. 343–351, June 1976.
17. V.G. Sprague, “On storage space of decision trees,” Commun. ACM, vol. 9, p. 319, May 1966.
18. M. Verhelst, “The conversion of limited-entry decision tables to optima] and near optimal flowcharts: Two new algorithms,” Commun. ACM, vol. 15, pp. 974–980, Nov. 1972.