Construction of all non-reducible descriptors

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