Classification based on full decision trees

DOI10.1134/S0965542512040082MaRDI QIDQ2836668zbMATH OpenFDO

Authors I. E. Genrikhov, E. V. Dyukova

Publication date 3 July 2013

Published in Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542512040082

zbMATH Keywords

classification algorithmsentropy branching criterionfull decision treeprecedent-based pattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Analysis of the generalization ability of a full decision tree
• scientific article; zbMATH DE number 3864536
• scientific article; zbMATH DE number 1014881
• Decision tree design from a communication theory standpoint
• Automatic construction of decision trees for classification

Cited in

(6)

• Decision tree design from a communication theory standpoint
• A new classification method to overcome over-branching
• Construction of all non-reducible descriptors
• Automatic construction of decision trees for classification
• Analysis of the generalization ability of a full decision tree
• scientific article; zbMATH DE number 1670576 (Why is no real title available?)

This page was built for publication: Classification based on full decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836668)