Application of information theory to the construction of efficient decision trees

DOI10.1109/TIT.1982.1056522zbMath0483.68064OpenAlexW1990822176MaRDI QIDQ3942413

Pramod K. Varshney, Kishan G. Mehrotra, Carlos R. P. Hartmann, Carl L. Gerberich

Publication date: 1982

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1982.1056522

zbMATH Keywords

heuristic approachconversion of decision tables to decision treesdon't care entriesefficient decision treeslow design complexitynear-optimal decision trees

Mathematics Subject Classification ID

Information theory (general) (94A15) Discrete mathematics in relation to computer science (68R99)

Related Items (5)

Decision tree design by simulated annealing ⋮ An experimental evaluation of simplicity in rule learning ⋮ Cellular tree classifiers ⋮ A unifying framework for trie design heuristics ⋮ A binary decision algorithm

This page was built for publication: Application of information theory to the construction of efficient decision trees