Classifier-dependent feature selection via greedy methods
From MaRDI portal
(Redirected from Publication:6581696)
Recommendations
Cites work
- 10.1162/153244303321897690
- A consistent and numerically efficient variable selection method for sparse Poisson regression with applications to learning and signal recovery
- A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates
- A greedy non-intrusive reduced order model for shallow water equations
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- An Introduction to Statistical Learning
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy
- Benchmark for filter methods for feature selection in high-dimensional classification data
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- Data-Driven Kernel Designs for Optimized Greedy Schemes: A Machine Learning Perspective
- Feature augmentation for the inversion of the Fourier transform with limited data
- Functions of positive and negative type, and their connection with the theory of integral equations.
- Gene selection for cancer classification using support vector machines
- Greedy approximation
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Interpolation with variably scaled kernels
- Kernel-based approximation methods using MATLAB
- Learning deep kernels in the space of dot product polynomials
- Meshfree approximation methods with Matlab. With CD-ROM.
- Model Selection and Estimation in Regression with Grouped Variables
- Near-optimal data-independent point locations for radial basis function interpolation
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- The Adaptive Lasso and Its Oracle Properties
- Theoretical and empirical analysis of ReliefF and RReliefF
Cited in
(4)- Integrating subdivision schemes into SVM for improved signal classification
- A recipe for learning variably scaled kernels via discontinuous neural networks
- Product kernels are efficient and flexible tools for high-dimensional scattered data interpolation
- Classifying vectors of probability density functions and their application to image data
This page was built for publication: Classifier-dependent feature selection via greedy methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581696)
