New Feature Selection Method Prods Probability Densities to Reveal Which Data Features Matter

Machine learning models are only as good as the features they are fed, yet in many scientific domains researchers face datasets with thousands or even tens of thousands of variables and only a handful of samples. In cancer genomics, for example, studies routinely involve more than 10,000 gene measurements from fewer than 100 patients. Choosing which features to keep and which to discard is therefore one of the most consequential steps in the entire modeling pipeline, and a new open-source method called ProD aims to make that step faster, more transparent, and far easier for humans to inspect.

ProD, short for “prodding” the Probability Densities, was developed by Jin Cheng Liaw, Francisco Geu Flores, and Wojciech Kowalczyk and published in the journal Machine Learning with Applications. It is a univariate filter method for feature selection, meaning it ranks features based purely on the statistical properties of the training data rather than by training and testing a specific machine learning model. That model-agnostic design carries real advantages: the ranked features can be confidently paired with any downstream algorithm, and because no iterative modeling is required, filter methods are dramatically cheaper to run than wrapper or embedded alternatives.

The core idea is borrowed from an unexpected place: ecology. Ecologists have long used the niche overlap coefficient to measure how much two coexisting species share the same resources. ProD adapts this concept to classification by estimating, for each feature, a probability density function separately for every class, and then computing the geometric intersection area between those density curves. If the distributions of two classes barely overlap on a given feature, that feature is a strong discriminator; if the curves lie almost entirely on top of one another, the feature carries little class-relevant information. The resulting score is a literal proportion between 0 and 1, which is precisely what makes the method so visually intuitive.

That visualizability is ProD’s defining departure from classical divergence metrics such as Kullback-Leibler divergence, the Bhattacharyya distance, and the Hellinger distance. These traditional measures remain popular largely because of mathematical convenience, offering closed-form solutions under Gaussian assumptions and, in the case of KL divergence, smooth differentiability suited to gradient-based optimization. But they are abstract, hard to plot, and prone to numerical instabilities when estimated non-parametrically. KL divergence, for instance, can blow up through division by zero in the tails of kernel density estimates. ProD sidesteps these problems by combining kernel density estimation with continuous numerical integration, producing a bounded, directly interpretable geometric quantity that faithfully reflects complex, multi-modal distributions without forcing parametric assumptions.

The method also distinguishes itself from mutual information and Relief-based filters, two other pillars of the feature selection literature. Mutual information, grounded in Shannon entropy, measures dependency between feature and target in bits or nats; Relief-family algorithms assign weights by repeatedly comparing each instance’s feature values with those of nearest neighbors of the same and different classes, effectively computing a spatial margin. Both are well established, but their outputs are proxy statistics that domain experts often find difficult to interpret. Because ProD evaluates the physical overlap area of continuous densities, practitioners can validate a feature ranking at a glance by simply plotting the class distributions, rather than trusting an opaque number.

Technically, the pipeline is straightforward. Each feature is min-max normalized to the interval from 0 to 1, split into class-specific subsets, and smoothed with Gaussian kernel density estimates along a fine evaluation grid. Bandwidth selection, which controls how much the densities are smoothed, is automated using Scott’s or Silverman’s classic rule-of-thumb formulas, with Scott’s rule emerging as the better default in testing. The intersection area between every pair of class densities is then computed by numerical integration and averaged across all class pairs. The authors also built in safeguards for awkward data: when the interquartile range collapses to zero on highly discrete or skewed arrays, the algorithm falls back on the sample standard deviation, and grid tails can be extended to handle boundary-heavy data.

Benchmarks were extensive. On synthetic datasets engineered with known relevant, redundant, and irrelevant features, including circuit-inspired ANDOR and ADDER problems and simulated microarray data with 4,060 features, ProD using Scott’s rule achieved the highest average index of success at 76.90, edging out established competitors such as ReliefF, I-Relief, LH-Relief, mutual information, the ANOVA F-ratio, and mRMR, while remaining highly robust across repeated dataset iterations. On real datasets spanning cancer microarrays, epilepsy electroencephalograms, gait recognition, human activity recognition, and network intrusion detection, ProD performed comparably to the strongest methods while running orders of magnitude faster than Relief-based approaches, which scale quadratically with sample size. ProD’s theoretical complexity grows only linearly in both samples and features, and its per-feature evaluation parallelizes cleanly across processor cores.

The method is not without limitations. As a univariate filter, it evaluates each feature in isolation and does not deliberately remove redundancy or capture multi-feature interactions, a deliberate trade-off that buys complete immunity to the curse of dimensionality and total ranking stability even when massive numbers of noisy features are added. Its reliance on kernel density estimation also makes it sensitive to sample size, with the authors warning users when a class contains fewer than five observations. On purely discrete data, probability mass functions or information-theoretic metrics remain theoretically more appropriate, and experiments confirmed that ProD’s selection ability is less reliable in discrete feature spaces unless bandwidths are carefully tuned.

One of the most instructive findings concerns multiclass problems. ProD’s default setting averages overlap areas over all pairs of classes, which implicitly assumes that an informative feature must separate every class pair simultaneously. On the synthetic ADDER dataset and the human activity recognition dataset, this default penalized features that brilliantly distinguished broad activity categories but failed on specific confusing sub-pairs, such as sitting versus standing. Switching the combinatorial hyperparameter from pairwise comparisons to evaluating all classes at once produced dramatic improvements, including perfect success rates on the discrete ADDER datasets and top-tier accuracies on the activity recognition task. A built-in heatmap of pairwise overlap areas lets users diagnose exactly which class pair is causing a feature to fail.

Beyond raw performance, the authors position ProD as a tool for human-in-the-loop machine learning, an increasingly urgent need in high-stakes domains like healthcare and drug discovery where black-box models have struggled to deliver on their promise. Because the method renders the underlying class distributions of every top-ranked feature, users can spot outliers that may be mislabeled samples, or peculiar clusters hinting at systematic errors in data collection, and iteratively refine both the dataset and the model. In interactive machine learning, where fast iteration often matters more than optimal first-pass results, a filter that is simultaneously fast, model-agnostic, and fully visualizable may prove to be exactly the kind of transparent interface that lets domain experts, not just algorithms, steer the science.

Subject of Research: A visualizable filter feature selection method based on class probability density overlap

Article Title: ProD: A visualizable filter-feature selection method based on “prodding” the class {Pro}bability {D}ensities for overlappping

Article References: Liaw, J. C., Geu Flores, F., & Kowalczyk, W. (2026). ProD: A visualizable filter-feature selection method based on “prodding” the class {Pro}bability {D}ensities for overlappping. Machine Learning with Applications, 26, Article 101035. https://doi.org/10.1016/j.mlwa.2026.101035

Image Credits: AI Generated

DOI: 10.1016/j.mlwa.2026.101035

Keywords: feature selection, machine learning, kernel density estimation, class overlap, niche overlap coefficient, filter methods, explainable AI, human-in-the-loop, high-dimensional data, bioinformatics, statistics, open-source software