Vipavee Damminsed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Vipavee Damminsed has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Rabian Wangkeeree
Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok 65000, Thailand
2 shared publications Dawrawee Makmuang
Department of Mathematics, Faculty of Science Naresuan University Phitsanulok Thailand
1 shared publicationSiwakon Suppalap
Department of Mathematics, Faculty of Science Naresuan University Phitsanulok Thailand
1 shared publicationWanida Panup
Geo‐Informatics and Space Technology Development Agency (GISTDA) Chonburi Thailand
1 shared publication- Wanida Panup
Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok 65000, Thailand
1 shared publication
Latest Publications
- 31 July 2023
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 46 (18) , 18729-18748
A novel support vector machine with generalized pinball loss for uncertain data classification
In real‐world problems, data suffer from measurement errors, data staleness, and repeated measurements, which make data uncertain. To consider the uncertainty of data, the concept of giving each data feature as a multidimensional Gaussian distribution has been utilized. In 2021, support vector machines with an insensitive zone pinball loss (UPinSVMs) for uncertain data classification was proposed, where is a positive number. The UPinSVMs bring noise insensitivity, stability for resampling, and increased model sparsity. However, the value of is known to be specified. In order to improve the performance, we combine the generalized pinball loss (( ‐Mod‐Pin‐SVM) into the uncertain classification, term as UGPinSVMs, where are two positive numbers. The generalized pinball loss is an optimal insensitive zone pinball loss and is an extension of existing loss functions that also addresses the issues of noise insensitivity and resampling instability. We solve the primal quadratic programming problems by transforming individuals into unconstrained optimization using an efficient stochastic gradient descent algorithm. More specially, we have introduced verified theorems that are related to our approaches and investigated scatter minimization. The results from several benchmark datasets show that our model outperforms the existing classifier in terms of accuracy and statistical analysis. Furthermore, the application of our framework to the crop recommendation dataset is also examined.
- 31 July 2023
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 46 (18) , 18729-18748
A novel support vector machine with generalized pinball loss for uncertain data classification
In real‐world problems, data suffer from measurement errors, data staleness, and repeated measurements, which make data uncertain. To consider the uncertainty of data, the concept of giving each data feature as a multidimensional Gaussian distribution has been utilized. In 2021, support vector machines with an insensitive zone pinball loss (UPinSVMs) for uncertain data classification was proposed, where is a positive number. The UPinSVMs bring noise insensitivity, stability for resampling, and increased model sparsity. However, the value of is known to be specified. In order to improve the performance, we combine the generalized pinball loss (( ‐Mod‐Pin‐SVM) into the uncertain classification, term as UGPinSVMs, where are two positive numbers. The generalized pinball loss is an optimal insensitive zone pinball loss and is an extension of existing loss functions that also addresses the issues of noise insensitivity and resampling instability. We solve the primal quadratic programming problems by transforming individuals into unconstrained optimization using an efficient stochastic gradient descent algorithm. More specially, we have introduced verified theorems that are related to our approaches and investigated scatter minimization. The results from several benchmark datasets show that our model outperforms the existing classifier in terms of accuracy and statistical analysis. Furthermore, the application of our framework to the crop recommendation dataset is also examined.
- Open Access
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 31399-31416
Laplacian Twin Support Vector Machine With Pinball Loss for Semi-Supervised Classification
Semi-supervised learning utilizes labeled data and the geometric information in the unlabeled data to construct a model whereas supervised learning makes use of the only label data. So, semi-supervised learning establishes a more reasonable classifier. In recent years, the Laplacian support vector machine (Lap-SVM) has received a lot of interest in the framework of semi-supervised classification. To develop the performance of Lap-SVM, Laplacian twin support vector machine (Lap-TSVM) has shown exceptional performance as an addition to improve the computational complexity. However, dealing with noise sensitivity and instability for resampling due to its hinge loss function is still a challenge. In this paper, we provide a novel Laplacian twin support vector machine by combining pinball loss function, termed as Lap-PTSVM, to effectively handle the aforementioned problems. As a result, it improves a better generalization ability of the classifier. Several experiments have been performed on artificial and UCI datasets. The results show that the proposed model has noise insensitivity comparable to the Lap-TSVM and has a great generalization performance. Furthermore, non-parametric statistical test are also conducted to justify the competitive performance of Lap-PTSVM.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 31399-31416
Open AccessLaplacian Twin Support Vector Machine With Pinball Loss for Semi-Supervised Classification
Semi-supervised learning utilizes labeled data and the geometric information in the unlabeled data to construct a model whereas supervised learning makes use of the only label data. So, semi-supervised learning establishes a more reasonable classifier. In recent years, the Laplacian support vector machine (Lap-SVM) has received a lot of interest in the framework of semi-supervised classification. To develop the performance of Lap-SVM, Laplacian twin support vector machine (Lap-TSVM) has shown exceptional performance as an addition to improve the computational complexity. However, dealing with noise sensitivity and instability for resampling due to its hinge loss function is still a challenge. In this paper, we provide a novel Laplacian twin support vector machine by combining pinball loss function, termed as Lap-PTSVM, to effectively handle the aforementioned problems. As a result, it improves a better generalization ability of the classifier. Several experiments have been performed on artificial and UCI datasets. The results show that the proposed model has noise insensitivity comparable to the Lap-TSVM and has a great generalization performance. Furthermore, non-parametric statistical test are also conducted to justify the competitive performance of Lap-PTSVM.