arXiv Machine Learning
Feature Selection for Latent Factor Models
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Oct 31
Worse than Random: The Importance of a Baseline for Unsupervised Feature Selection -- Extended Version
The paper argues that many newly proposed unsupervised feature selection methods are evaluated only against other methods without a proper baseline. Using random feature selection as a baseline, the authors demonstrate that several state‑of‑the‑art methods are actually outperformed in both performance and efficiency. They call for the inclusion of random selection as a baseline and for the development of better evaluation metrics to ensure realistic assessment of future methods.
arXiv Machine Learning
Aug 4
Beyond Noise: A Hypothesis Testing Approach to Robust Feature Selection
arXiv:2511. 20851v3 Announce Type: replace-cross Abstract: Feature selection remains difficult in modern high-dimensional settings, and established methods such as Boruta and Recursive Feature Elimination are either computationally costly or lack a statistically justified stopping criterion for their importance scores.
arXiv Machine Learning
5d ago
Unsupervised Feature Selection Using Local Intrinsic Dimensionality -- Extended Version
The paper introduces LIDFS, an unsupervised feature selection technique that uses Local Intrinsic Dimensionality (LID) to rank features based on their local discriminability. By treating each feature as a point and estimating its LID via maximum likelihood from distances to its k nearest neighboring features, LIDFS assigns higher importance to features with lower LID and refines the ranking to remove locally redundant features. Experiments on 23 high‑dimensional datasets show that LIDFS outperforms both classic and state‑of‑the‑art methods in supervised and clustering evaluations while running faster than its closest competitor.
arXiv Machine Learning
Sep 10
Improving Multivariate Time Series Classification with Class-Wise Training and Model Aggregation
arXiv:2609.07493v1 Announce Type: new Abstract: In this paper, we propose a class-wise dimension (channel) selection framework for Multivariate Time Series Classification (MTSC). Rather than applying...
arXiv Machine Learning
Sep 15
Towards Truly Unsupervised Evaluation of Feature Selection -- Extended Version
arXiv:2608.12057v4 Announce Type: replace Abstract: Feature selection is one of the most important and fundamental tasks in data mining, tackled by a family of methods with an established set of eval...
arXiv Machine Learning
Aug 13
Towards Truly Unsupervised Evaluation of Feature Selection
arXiv:2608. 12057v1 Announce Type: new Abstract: Feature selection is one of the most important and fundamental tasks in data mining, tackled by a family of methods with an established set of evaluation techniques to measure the quality of a specific method.