Training support vector machines (SVMs) with nonlinear kernel functions on large-scale data are usually very timeconsuming. In contrast, there exist faster solvers to train the linear SVM. We propose a technique which sufficiently approximates the infinite-dimensional implicit feature mapping of the Gaussian kernel function by a low-dimensional feature mapping. By explicitly mapping data to the...

Support vector machines (SVM) have been promising methods for classification analysis due to their solid mathematical foundations. Clustering-based SVMs are used to solve large samples classification problems and reduce the computational cost. In this paper, we present a density clustering based SVM(DCB-SVM) method to predict polyadenylation signal (PAS) in human DNA and mRNA sequences. We decr...

SVM is extensively used in pattern recognition because of its capability to classify future unseen data and its’ good generalization performance. Several algorithms and models have been proposed for pattern recognition that uses SVM for classification. These models proved the efficiency of SVM in pattern recognition. Researchers have compared their results for SVM with other traditional empiric...

Support Vector Machine (SVM) is a classification technique based on Structural Risk Minimization (SRM), which can run on MATLAB. For classification of nonseparable samples, conventional SVM needs to select a tradeoff between maximization the margin and misclassification rate. In order to guarantee generalized performance and low misclassification rate of SVM, this paper puts forward an improved...

In this paper, we propose a novel method based on support vector machine (SVM) for microarray classification and gene (feature) selection. The proposed method, called similaritybased SVM (SSVM), incorporates the prior knowledge of gene similarity into the standard SVM by combining the standard l2 norm and the similarity penalty of all the genes. The preliminary experiments show that our method ...

Nonconvex variants of support vector machines (SVMs) have been developed for various purposes. For example, robust SVMs attain robustness to outliers by using a nonconvex loss function, while extended [Formula: see text]-SVM (E[Formula: see text]-SVM) extends the range of the hyperparameter by introducing a nonconvex constraint. Here, we consider an extended robust support vector machine (ER-SV...

The optimal parameters of the support vector machine (SVM) are very important for accuracy modeling and generalization performance. The quantum particle swarm optimization (QPSO) algorithm takes on the characteristics of the rapid global optimization, scale chaos method provides the characteristics of the fast convergence and the SVM has the characteristics of the nonlinear fitting. These advan...

PURPOSE The classification between different gait patterns is a frequent task in gait assessment. The base vectors were usually found using principal component analysis (PCA) is replaced by an iterative application of the support vector machine (SVM). The aim was to use classifyability instead of variability to build a subspace (SVM space) that contains the information about classifiable aspect...