Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
From MaRDI portal
Publication:3389595
Cites work
- scientific article; zbMATH DE number 3444596 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- A stepwise regression method and consistent model selection for highdimensional sparse linear models
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- Atomic Decomposition by Basis Pursuit
- Discrete particle swarm optimization for constructing uniform design on irregular regions
- Estimating the dimension of a model
- Extended Bayesian information criteria for model selection with large model spaces
- Huber-type principal expectile component analysis
- Massively parallel feature selection: an approach based on variance preservation
- On convergence analysis of particle swarm optimization algorithm
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions
- Optimizing Latin hypercube designs by particle swarm
- Random lasso
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389595)
