scientific article; zbMATH DE number 2080452

MaRDI QIDQ4473244zbMATH OpenFDO

Authors Richard Nock, Marc Sebban

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1968/19680224.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational learning theory (68Q32)

Recommendations

• Selection of relevant features and examples in machine learning
• Consistent feature selection for pattern recognition in polynomial time
• A parameterized complexity analysis of combinatorial feature selection problems
• On the difficulty of approximately maximizing agreements.
• The PM-M prototype selection system

Cited in

(2)

• A hybrid filter/wrapper approach of feature selection using information theory
• Self-improved gaps almost everywhere for the agnostic approximation of monomials

This page was built for publication:

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