The minimum feature set problem

DOI10.1016/0893-6080(94)90082-5zbMath0900.68370OpenAlexW2055738030MaRDI QIDQ1338270

Tony R. Martinez, Kevin S. Van Horn

Publication date: 22 November 1995

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-6080(94)90082-5

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

On the computational hardness based on linear fpt-reductions ⋮ On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems ⋮ Tight lower bounds for certain parameterized NP-hard problems

Cites Work

• Unnamed Item
• Unnamed Item
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Learnability and the Vapnik-Chervonenkis dimension
• Efficient probabilistically checkable proofs and applications to approximations

This page was built for publication: The minimum feature set problem