Automated Feature Selection without Manual Thresholding

This direction is split into other directions: manual feature subset sizing, automated stopping criteria (automated subset size determination). Its last version stays readable and citable here.

Version 1 of 1122 papers132 conceptsfrozen 2026-10-04

In high-dimensional machine learning, feature selection is the process of separating the "signal" from the "noise." Traditionally, this process has a hidden dependency: the human in the loop. Most algorithms require a user to pre-specify exactly how many features to keep ($k$) or what the importance threshold should be.

As noted by Jundong Li and Huan Liu in Feature Selection: A Data Perspective, this manual intervention is a major bottleneck. If you pick too many features, you retain noise; if you pick too few, you lose critical information. A growing body of research is moving toward automated subset size determination, where the data itself dictates the optimal cutoff.

The Problem of the Arbitrary K

The "k" problem appears across diverse fields. In metagenomics, Gregory Ditzler and colleagues point out in Fizzy: feature subset selection for metagenomics that arbitrary heuristics often miss biological signals. Similarly, in the world of brain-computer interfaces, Cross-Correlation Based Discriminant Criterion for Channel Selection in Motor Imagery BCI Systems highlights that selecting the number of EEG sensors manually limits the system's ability to adapt to different users.

The core challenge is that the "optimal" number of features isn't a fixed constant; it changes based on the dataset's intrinsic dimensionality and the specific task.

Global Importance through Complex Networks

One way to automate this is to stop looking at features in isolation. Traditional methods score features one by one, but researchers like Yan Tang suggest a "global" view. In A Feature Selection Method from the View Of Complex Network, Tang introduces FSCN, which treats features as nodes in a graph. By applying algorithms like PageRank, the system can identify which features are "globally" redundant.

This graph-based intuition is pushed further by Simone Melzi and Giorgio Roffo in Infinite Feature Selection: A Graph-based Feature Filtering Approach. They model feature subsets as paths of infinite length in a graph. This allows them to derive a closed-form solution for feature importance that naturally reveals where the "relevant" features end and the "noise" begins, reducing the need for manual thresholding.

If the goal is to find the best subset size, why not make the size part of the optimization? Si Liu and Shuicheng YAN proposed SASMIF in Size Adaptive Selection of Most Informative Features. Unlike greedy algorithms that add features until they hit a limit, SASMIF adaptively searches for the subset size that maximizes information density.

A similar "self-tuning" philosophy is found in evolutionary computation. Ren Diao and Qiang Shen developed Self-adjusting harmony search-based feature selection, which dynamically prunes the search space. Instead of the user defining the subset size, the algorithm "musicians" (features) are discarded if they don't contribute to the overall harmony (accuracy).

Automating the Threshold in Specialized Domains

The push for automation is particularly urgent in fields where manual tuning is impossible or dangerous:

Why It Works: Finding the Natural Break

The intuition behind these methods is that high-dimensional data usually has a "knee" or "elbow" in its importance distribution. While traditional methods calculate the scores and wait for a human to draw the line, modern research focuses on automated scale detection. By using graph topology (Tomaso Aste in Topological Feature Selection) or reinforcement learning (Wei Fan in DAIRS), these systems can detect the point where adding more features starts to degrade the model's generalization.

The goal is a "plug-and-play" pipeline where the researcher provides the data, and the algorithm determines not just which features matter, but exactly how many are needed to tell the story.

Papers in this version

Showing 60 of 122 papers.

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_automated_feature_selection_without_manu_99cdf2b6,
  title = {Automated Feature Selection without Manual Thresholding},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/automated-feature-selection-without-manual-thresholding/rdr_99cdf2b69d1946d0a8c1f82b6b03afc0},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_automated_feature_selection_without_manu_99cdf2b6_v1,
  title = {Automated Feature Selection without Manual Thresholding},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/automated-feature-selection-without-manual-thresholding/rdr_99cdf2b69d1946d0a8c1f82b6b03afc0/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}