-
Something wrong with this record ?
Inverse free reduced universum twin support vector machine for imbalanced data classification
H. Moosaei, MA. Ganaie, M. Hladík, M. Tanveer
Language English Country United States
Document type Journal Article
- MeSH
- Algorithms * MeSH
- Support Vector Machine * MeSH
- Publication type
- Journal Article MeSH
Imbalanced datasets are prominent in real-world problems. In such problems, the data samples in one class are significantly higher than in the other classes, even though the other classes might be more important. The standard classification algorithms may classify all the data into the majority class, and this is a significant drawback of most standard learning algorithms, so imbalanced datasets need to be handled carefully. One of the traditional algorithms, twin support vector machines (TSVM), performed well on balanced data classification but poorly on imbalanced datasets classification. In order to improve the TSVM algorithm's classification ability for imbalanced datasets, recently, driven by the universum twin support vector machine (UTSVM), a reduced universum twin support vector machine for class imbalance learning (RUTSVM) was proposed. The dual problem and finding classifiers involve matrix inverse computation, which is one of RUTSVM's key drawbacks. In this paper, we improve the RUTSVM and propose an improved reduced universum twin support vector machine for class imbalance learning (IRUTSVM). We offer alternative Lagrangian functions to tackle the primal problems of RUTSVM in the suggested IRUTSVM approach by inserting one of the terms in the objective function into the constraints. As a result, we obtain new dual formulation for each optimization problem so that we need not compute inverse matrices neither in the training process nor in finding the classifiers. Moreover, the smaller size of the rectangular kernel matrices is used to reduce the computational time. Extensive testing is carried out on a variety of synthetic and real-world imbalanced datasets, and the findings show that the IRUTSVM algorithm outperforms the TSVM, UTSVM, and RUTSVM algorithms in terms of generalization performance.
Department of Mathematics Indian Institute of Technology Indore Simrol Indore 453552 India
Department of Robotics University of Michigan Ann Arbor MI 48109 USA
References provided by Crossref.org
- 000
- 00000naa a2200000 a 4500
- 001
- bmc22032034
- 003
- CZ-PrNML
- 005
- 20230131151613.0
- 007
- ta
- 008
- 230120s2023 xxu f 000 0|eng||
- 009
- AR
- 024 7_
- $a 10.1016/j.neunet.2022.10.003 $2 doi
- 035 __
- $a (PubMed)36334534
- 040 __
- $a ABA008 $b cze $d ABA008 $e AACR2
- 041 0_
- $a eng
- 044 __
- $a xxu
- 100 1_
- $a Moosaei, Hossein $u Department of Informatics, Faculty of Science, Jan Evangelista Purkyně University, Ústí nad Labem, Czech Republic; Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. Electronic address: hossein.moosaei@ujep.cz
- 245 10
- $a Inverse free reduced universum twin support vector machine for imbalanced data classification / $c H. Moosaei, MA. Ganaie, M. Hladík, M. Tanveer
- 520 9_
- $a Imbalanced datasets are prominent in real-world problems. In such problems, the data samples in one class are significantly higher than in the other classes, even though the other classes might be more important. The standard classification algorithms may classify all the data into the majority class, and this is a significant drawback of most standard learning algorithms, so imbalanced datasets need to be handled carefully. One of the traditional algorithms, twin support vector machines (TSVM), performed well on balanced data classification but poorly on imbalanced datasets classification. In order to improve the TSVM algorithm's classification ability for imbalanced datasets, recently, driven by the universum twin support vector machine (UTSVM), a reduced universum twin support vector machine for class imbalance learning (RUTSVM) was proposed. The dual problem and finding classifiers involve matrix inverse computation, which is one of RUTSVM's key drawbacks. In this paper, we improve the RUTSVM and propose an improved reduced universum twin support vector machine for class imbalance learning (IRUTSVM). We offer alternative Lagrangian functions to tackle the primal problems of RUTSVM in the suggested IRUTSVM approach by inserting one of the terms in the objective function into the constraints. As a result, we obtain new dual formulation for each optimization problem so that we need not compute inverse matrices neither in the training process nor in finding the classifiers. Moreover, the smaller size of the rectangular kernel matrices is used to reduce the computational time. Extensive testing is carried out on a variety of synthetic and real-world imbalanced datasets, and the findings show that the IRUTSVM algorithm outperforms the TSVM, UTSVM, and RUTSVM algorithms in terms of generalization performance.
- 650 12
- $a support vector machine $7 D060388
- 650 12
- $a algoritmy $7 D000465
- 655 _2
- $a časopisecké články $7 D016428
- 700 1_
- $a Ganaie, M A $u Department of Mathematics, Indian Institute of Technology Indore, Simrol, Indore, 453552, India; Department of Robotics, University of Michigan, Ann Arbor, MI, 48109, USA. Electronic address: phd1901141006@iiti.ac.in
- 700 1_
- $a Hladík, Milan $u Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. Electronic address: hladik@kam.mff.cuni.cz
- 700 1_
- $a Tanveer, M $u Department of Mathematics, Indian Institute of Technology Indore, Simrol, Indore, 453552, India. Electronic address: mtanveer@iiti.ac.in
- 773 0_
- $w MED00011811 $t Neural networks : the official journal of the International Neural Network Society $x 1879-2782 $g Roč. 157, č. - (2023), s. 125-135
- 856 41
- $u https://pubmed.ncbi.nlm.nih.gov/36334534 $y Pubmed
- 910 __
- $a ABA008 $b sig $c sign $y p $z 0
- 990 __
- $a 20230120 $b ABA008
- 991 __
- $a 20230131151609 $b ABA008
- 999 __
- $a ok $b bmc $g 1891048 $s 1183369
- BAS __
- $a 3
- BAS __
- $a PreBMC-MEDLINE
- BMC __
- $a 2023 $b 157 $c - $d 125-135 $e 20221015 $i 1879-2782 $m Neural networks $n Neural Netw $x MED00011811
- LZP __
- $a Pubmed-20230120