The minimum feature set problem

DOI10.1016/0893-6080(94)90082-5MaRDI QIDQ1338270zbMATH OpenOpenAlexFDO

Authors Kevin S. Van Horn, Tony R. Martinez

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)

Cites work

• Efficient probabilistically checkable proofs and applications to approximations
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• Learnability and the Vapnik-Chervonenkis dimension
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338270)