For classification problems,the traditional least squares twin support vector machine(LSTSVM)generates two nonparallel hyperplanes directly by solving two systems of linear equations instead of a pair of quadratic pro...For classification problems,the traditional least squares twin support vector machine(LSTSVM)generates two nonparallel hyperplanes directly by solving two systems of linear equations instead of a pair of quadratic programming problems(QPPs),which makes LSTSVM much faster than the original TSVM.But the standard LSTSVM adopting quadratic loss measured by the minimal distance is sensitive to noise and unstable to re-sampling.To overcome this problem,the expectile distance is taken into consideration to measure the margin between classes and LSTSVM with asymmetric squared loss(aLSTSVM)is proposed.Compared to the original LSTSVM with the quadratic loss,the proposed aLSTSVM not only has comparable computational accuracy,but also performs good properties such as noise insensitivity,scatter minimization and re-sampling stability.Numerical experiments on synthetic datasets,normally distributed clustered(NDC)datasets and University of California,Irvine(UCI)datasets with different noises confirm the great performance and validity of our proposed algorithm.展开更多
In order to improve the learning speed and reduce computational complexity of twin support vector hypersphere(TSVH),this paper presents a smoothed twin support vector hypersphere(STSVH)based on the smoothing technique...In order to improve the learning speed and reduce computational complexity of twin support vector hypersphere(TSVH),this paper presents a smoothed twin support vector hypersphere(STSVH)based on the smoothing technique.STSVH can generate two hyperspheres with each one covering as many samples as possible from the same class respectively.Additionally,STSVH only solves a pair of unconstraint differentiable quadratic programming problems(QPPs)rather than a pair of constraint dual QPPs which makes STSVH faster than the TSVH.By considering the differentiable characteristics of STSVH,a fast Newton-Armijo algorithm is used for solving STSVH.Numerical experiment results on normally distributed clustered datasets(NDC)as well as University of California Irvine(UCI)data sets indicate that the significant advantages of the proposed STSVH in terms of efficiency and generalization performance.展开更多
基金supported in part by the National Natural Science Foundation of China(51875457)Natural Science Foundation of Shaanxi Province of China(2021JQ-701)+1 种基金the Key Research Project of Shaanxi Province(2022GY-050,2022GY-028)Xi’an Science and Technology Plan Project(2020KJRC0109)。
文摘For classification problems,the traditional least squares twin support vector machine(LSTSVM)generates two nonparallel hyperplanes directly by solving two systems of linear equations instead of a pair of quadratic programming problems(QPPs),which makes LSTSVM much faster than the original TSVM.But the standard LSTSVM adopting quadratic loss measured by the minimal distance is sensitive to noise and unstable to re-sampling.To overcome this problem,the expectile distance is taken into consideration to measure the margin between classes and LSTSVM with asymmetric squared loss(aLSTSVM)is proposed.Compared to the original LSTSVM with the quadratic loss,the proposed aLSTSVM not only has comparable computational accuracy,but also performs good properties such as noise insensitivity,scatter minimization and re-sampling stability.Numerical experiments on synthetic datasets,normally distributed clustered(NDC)datasets and University of California,Irvine(UCI)datasets with different noises confirm the great performance and validity of our proposed algorithm.
基金This work was supported by the National Natural Science Foundation of China(51875457)the Key Research Project of Shanxi Province(2019GY-061)the International S&T Cooperation Program of Shanxi Province(2019KW-056)。
文摘In order to improve the learning speed and reduce computational complexity of twin support vector hypersphere(TSVH),this paper presents a smoothed twin support vector hypersphere(STSVH)based on the smoothing technique.STSVH can generate two hyperspheres with each one covering as many samples as possible from the same class respectively.Additionally,STSVH only solves a pair of unconstraint differentiable quadratic programming problems(QPPs)rather than a pair of constraint dual QPPs which makes STSVH faster than the TSVH.By considering the differentiable characteristics of STSVH,a fast Newton-Armijo algorithm is used for solving STSVH.Numerical experiment results on normally distributed clustered datasets(NDC)as well as University of California Irvine(UCI)data sets indicate that the significant advantages of the proposed STSVH in terms of efficiency and generalization performance.
