Research map / Label-efficient and robust learning / Recognition and long-tail
Unsupervised Feature Selection by Pareto Optimization
Chao Feng, Chao Qian, Ke Tang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use POCSS instead of IterFS | column subset selection · 10 UCI/LIBSVM data sets, k=50 | average rank: 2.45 -> 1.2 | Improved |
| use POCSS instead of Greedy | column subset selection · musk (k=50) | error ratio: 1.774 -> 1.656±0.012 | Improved |
| use POCSS instead of IterFS | column subset selection · RlCTs (k=50) | error ratio: 1.452±0.051 -> 1.420±0.003 | Improved |
| use POCSS instead of IterFS | column subset selection · madelon (k=50) | error ratio: 1.056±0.000 -> 1.056±0.000 | No clear effect |
| vary cardinality k from 50 to 100 | POCSS vs baselines · mediamill, musk, dna, scene | error ratio | Improved |
Closest papers by meaning
- A determinantal point process for column subset selection (JMLR 2020 · similarity 0.89)
- Multi-View Unsupervised Column Subset Selection via Combinatorial Search (Student Abstract) (AAAI 2025 · similarity 0.89)
- Greedy Column Subset Selection: New Bounds and Distributed Algorithms (ICML 2016 · similarity 0.87)
- Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality (AAAI 2016 · similarity 0.86)
- Linear Time Approximation Algorithm for Column Subset Selection with Local Search (NeurIPS 2024 · similarity 0.85)
- Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination (ICML 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
