Sharper bounds for the hardness of prototype and feature selection
From MaRDI portal
(Redirected from Sharper bounds for the hardness of prototype and feature selection)
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)
This page was built for publication: Sharper bounds for the hardness of prototype and feature selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473244)