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

Construction of all non-reducible descriptors

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

DOI10.1016/j.patcog.2004.03.007zbMath1070.68577OpenAlexW2024691045MaRDI QIDQ1886683

Asai Asaithambi, Ventzeslav Valev

Publication date: 18 November 2004

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2004.03.007


zbMATH Keywords

ComplexityNP-completeSupervised pattern recognitionBinary featuresDecision-tree modelNon-reducible descriptorsTraining table


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)




Cites Work

  • PUBLIC: A decision tree classifier that integrates building and pruning
  • Supervised pattern recognition by parallel feature partitioning
  • A theory of the learnable
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Construction of all non-reducible descriptors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1886683&oldid=14289080"
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 13:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki