APPLICATION OF INFORMATION-THEORY TO THE CONSTRUCTION OF EFFICIENT DECISION TREES

被引：54

作者：

HARTMANN, CRP

VARSHNEY, PK

MEHROTRA, KG

GERBERICH, CL

机构：

[1] SYRACUSE UNIV, DEPT ELECT & COMP ENGN, SYRACUSE, NY 13210 USA

[2] IBM CORP, POUGHKEEPSIE, NY 12601 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1982年 / 28卷 / 04期

关键词：

D O I：

10.1109/TIT.1982.1056522

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：565 / 577

页数：13

共 39 条

[1]

ALSTER TM, 1971, UIUCDCSR71474 U ILL

[2]

BAYES AT, 1973, AUSTR COMPUT J, V4, P77

[3]

Billingsley P., 1965, ERGODIC THEORY INFOR

[4] COMPLEXITY OF TRIE INDEX CONSTRUCTION [J].

COMER, D ;

SETHI, R .

JOURNAL OF THE ACM, 1977, 24 (03) :428-440

[5] A PROCEDURE FOR CONVERTING LOGIC TABLE CONDITIONS INTO AN EFFICIENT SEQUENCE OF TEST INSTRUCTIONS [J].

EGLER, JF .

COMMUNICATIONS OF THE ACM, 1963, 6 (09) :510-514

[6]

FARIA JM, 1981, 1981 IEEE INT S INF

[7]

FISHER DL, 1965, COMMUN ASS COMPUT MA, V18, P26

[8] INFORMATION-THEORY APPLIED TO CONVERSION OF DECISION TABLES TO COMPUTER PROGRAMS [J].

GANAPATHY, S ;

RAJARAMAN, V .

COMMUNICATIONS OF THE ACM, 1973, 16 (09) :532-539

[9]

GANAPATHY S, 1969, INFORMATION THEORY A

[10] OPTIMAL BINARY IDENTIFICATION PROCEDURES [J].

GAREY, MR .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1972, 23 (02) :173-+

← 1 2 3 4 →