Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
From MaRDI portal
Publication:3389595
DOI10.1080/00949655.2021.1890731OpenAlexW3134944916MaRDI QIDQ3389595
Chien-Chih Huang, Ray-Bing Chen, Wei-Chung Wang
Publication date: 23 March 2022
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2021.1890731
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A stepwise regression method and consistent model selection for high-dimensional sparse linear models
- Massively parallel feature selection: an approach based on variance preservation
- Random lasso
- On convergence analysis of particle swarm optimization algorithm
- Optimizing Latin hypercube designs by particle swarm
- Huber-type principal expectile component analysis
- Estimating the dimension of a model
- Discrete particle swarm optimization for constructing uniform design on irregular regions
- Extended Bayesian information criteria for model selection with large model spaces
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sure Independence Screening for Ultrahigh Dimensional Feature Space
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
This page was built for publication: Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
