Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
From MaRDI portal
Publication:3389595
DOI10.1080/00949655.2021.1890731OpenAlexW3134944916MaRDI QIDQ3389595FDOQ3389595
Authors: Ray-Bing Chen, Chien-Chih Huang, Weichung 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
Cites Work
- Estimating the dimension of a model
- The Adaptive Lasso and Its Oracle Properties
- Extended Bayesian information criteria for model selection with large model spaces
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Sure Independence Screening for Ultrahigh Dimensional Feature Space
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- Random lasso
- A stepwise regression method and consistent model selection for highdimensional sparse linear models
- Massively parallel feature selection: an approach based on variance preservation
- On convergence analysis of particle swarm optimization algorithm
- Optimizing Latin hypercube designs by particle swarm
- Discrete particle swarm optimization for constructing uniform design on irregular regions
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions
- Huber-type principal expectile component analysis
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
Uses Software
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)
