The optimal strategy of a tree classifier

DOI10.1016/0031-3203(83)90011-0MaRDI QIDQ1838005zbMATH OpenOpenAlexFDO

Authors Marek Kurzynski

Publication date 1983

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(83)90011-0

zbMATH Keywords

pattern recognitionoptimal strategyprobability of misclassificationdecision tree classifier

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cites work

• scientific article; zbMATH DE number 3586871 (Why is no real title available?)
• A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees
• An Algorithm for Constructing Optimal Binary Decision Trees
• Efficient decision tree design for discrete variable pattern recognition problems
• On the Mean Accuracy of Hierarchical Classifiers
• Some New Error Bounds and Approximations for Pattern Recognition

Cited in

(2)

• Cellular tree classifiers
• On the multistage Bayes classifier

This page was built for publication: The optimal strategy of a tree classifier

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