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

A method for the design of binary tree classifiers

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

DOI10.1016/0031-3203(83)90076-6zbMath0534.62042OpenAlexW2064356212MaRDI QIDQ790568

N. E. Zubov

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)90076-6


zbMATH Keywords

discriminant functionpattern classificationfeature selectionbinary tree classifiersbranch and bound searchmultivariate stepwise regression


Mathematics Subject Classification ID

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


Related Items (2)

Cellular tree classifiers ⋮ A simple and fast multi-class piecewise linear pattern classifier



Cites Work

  • Regression and the Moore-Penrose pseudoinverse




This page was built for publication: A method for the design of binary tree classifiers

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