The optimal strategy of a tree classifier

DOI10.1016/0031-3203(83)90011-0zbMATH Open0508.62053OpenAlexW177910787MaRDI QIDQ1838005FDOQ1838005

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

• Efficient decision tree design for discrete variable pattern recognition problems
• An Algorithm for Constructing Optimal Binary Decision Trees
• A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees
• On the Mean Accuracy of Hierarchical Classifiers
• Title not available (Why is that?)
• Some New Error Bounds and Approximations for Pattern Recognition

Cited In (2)

• On the multistage Bayes classifier
• Cellular tree classifiers

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)