Evolution strategies based adaptive \(L_{p}\) LS-SVM

DOI10.1016/j.ins.2011.02.029zbMath1216.68227OpenAlexW1984824617MaRDI QIDQ545383

Liwei Wei, Zhen-Yu Chen, Jian-ping Li

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.02.029

zbMATH Keywords

classificationevolution strategiesadaptive penaltyleast squares support vector machine

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (8)

Asymmetric least squares support vector machine classifiers ⋮ Oil-importing optimal decision considering country risk with extreme events: a multi-objective programming approach ⋮ Robust echo state network with sparse online learning ⋮ A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation ⋮ Image denoising using SVM classification in nonsubsampled contourlet transform domain ⋮ Online independent reduced least squares support vector regression ⋮ Incremental kernel minimum squared error (KMSE) ⋮ HYPER-PARAMETER SELECTION FOR SPARSE LS-SVM VIA MINIMIZATION OF ITS LOCALIZED GENERALIZATION ERROR

Uses Software

• SHOGUN
• LIBSVM
• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Benchmarking least squares support vector machine classifiers
• Support vector machines with adaptive \(L_q\) penalty
• Heuristics of instability and stabilization in model selection
• Evolution strategies. A comprehensive introduction
• SAR image superresolution via 2D adaptive extrapolation
• Weighted least squares support vector machines: robustness and sparse approximation
• A weighted rough set based method developed for class imbalance learning
• Interior-point methods in \(l_1\) optimal sparse representation algorithms for harmonic retrieval
• An efficient support vector machine learning method with second-order cone programming for large-scale problems
• Atomic Decomposition by Basis Pursuit
• An affine scaling methodology for best basis selection
• Time-frequency localization operators: a geometric phase space approach
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• SAR imaging via modern 2-D spectral estimation methods
• Radius Margin Bounds for Support Vector Machines with the RBF Kernel
• Massive data discrimination via linear support vector machines
• Choosing multiple parameters for support vector machines
• Large scale kernel regression via linear programming
• Discussion on boosting papers.

This page was built for publication: Evolution strategies based adaptive \(L_{p}\) LS-SVM