Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The optimal strategy of a tree classifier

From MaRDI portal
Publication:1838005
Jump to:navigation, search

DOI10.1016/0031-3203(83)90011-0zbMath0508.62053OpenAlexW177910787MaRDI QIDQ1838005

Marek W. Kurzyński

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

optimal strategypattern recognitionprobability of misclassificationdecision tree classifier


Mathematics Subject Classification ID

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


Related Items (2)

On the multistage Bayes classifier ⋮ Cellular tree classifiers




Cites Work

  • Unnamed Item
  • Efficient decision tree design for discrete variable pattern recognition problems
  • An Algorithm for Constructing Optimal Binary Decision Trees
  • On the Mean Accuracy of Hierarchical Classifiers
  • Some New Error Bounds and Approximations for Pattern Recognition
  • A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1838005&oldid=14211912"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki