Smooth pinball loss nonparallel support vector machine for robust classification

MZ Liu, YH Shao, CN Li, WJ Chen - Applied Soft Computing, 2021 - Elsevier
In this paper, we propose a robust smooth pinball loss nonparallel support vector machine
(SpinNSVM) for binary classification. We first define a smooth pinball loss function, which is …

Sparse SVM for sufficient data reduction

S Zhou - IEEE transactions on pattern analysis and machine …, 2021 - ieeexplore.ieee.org
Kernel-based methods for support vector machines (SVM) have shown highly advantageous
performance in various applications. However, they may incur prohibitive computational …

A joint learning framework for optimal feature extraction and multi-class SVM

Z Lai, G Liang, J Zhou, H Kong, Y Lu - Information Sciences, 2024 - Elsevier
In high-dimensional data classification, effectively extracting discriminative features while
eliminating redundancy is crucial for enhancing the performances of classifiers, such as …

Very sparse LSSVM reductions for large-scale data

R Mall, JAK Suykens - IEEE transactions on neural networks …, 2015 - ieeexplore.ieee.org
Least squares support vector machines (LSSVMs) have been widely applied for
classification and regression with comparable performance with SVMs. The LSSVM model …

Sparse Lq-norm least squares support vector machine with feature selection

YH Shao, CN Li, MZ Liu, Z Wang, NY Deng - Pattern Recognition, 2018 - Elsevier
Least squares support vector machine (LS-SVM) is a popular hyperplane-based classifier
and has attracted many attentions. However, it may suffer from singularity or ill-condition …

Structural learning in artificial neural networks using sparse optimization

M Manngård, J Kronqvist, JM Böling - Neurocomputing, 2018 - Elsevier
In this paper, the problem of simultaneously estimating the structure and parameters of
artificial neural networks with multiple hidden layers is considered. A method based on …

When are overcomplete topic models identifiable? uniqueness of tensor tucker decompositions with structured sparsity

A Anandkumar, DJ Hsu, M Janzamin… - Advances in neural …, 2013 - proceedings.neurips.cc
Overcomplete latent representations have been very popular for unsupervised feature
learning in recent years. In this paper, we specify which overcomplete models can be …

Noniterative sparse LS-SVM based on globally representative point selection

Y Ma, X Liang, G Sheng, JT Kwok… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
A least squares support vector machine (LS-SVM) offers performance comparable to that of
SVMs for classification and regression. The main limitation of LS-SVM is that it lacks sparsity …

Sparse reductions for fixed-size least squares support vector machines on large scale data

R Mall, JAK Suykens - Pacific-Asia Conference on Knowledge Discovery …, 2013 - Springer
Abstract Fixed-Size Least Squares Support Vector Machines (FS-LSSVM) is a powerful tool
for solving large scale classification and regression problems. FS-LSSVM solves an over …

A regularized estimation framework for online sparse LSSVR models

JDA Santos, GA Barreto - Neurocomputing, 2017 - Elsevier
Aiming at machine learning applications in which fast online learning is required, we
develop a variant of the Least Squares SVR (LSSVR) model that can learn incrementally …