Study Features via Exploring Distribution Structure
Not on the map. Why?
Abstract (arXiv)
In this paper, we present a novel framework for data redundancy measurement based on probabilistic modeling of datasets, and a new criterion for redundancy detection that is resilient to noise. We also develop new methods for data redundancy reduction using both deterministic and stochastic optimization techniques. Our framework is flexible and can handle different types of features, and our experiments on benchmark datasets demonstrate the effectiveness of our methods. We provide a new perspective on feature selection, and propose effective and robust approaches for both supervised and unsupervised learning problems.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 44 references that are in the map. First posted on arXiv 15 Jan 2024.
Builds on
5 of 44 references.
References · 5
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
- 2019LassoNet: A Neural Network with Feature Sparsitycited by 81
- 2021A Rigorous Information-Theoretic Definition of Redundancy and Relevancy in Feature Selection Based on (Partial) Information Decompositioncited by 25
- 2020Fractal Autoencoders for Feature Selectioncited by 8
Built on by
Not cited yet.