An enhanced KNN-based twin support vector machine with stable learning rules

Journal Article (2020)
Author(s)

Jalal A. Nasiri (Iranian Research Institute for Information Science and Technology (IranDoc))

S.A.M. Mir (TU Delft - Software Engineering)

Research Group
Software Engineering
Copyright
© 2020 Jalal A. Nasiri, S.A.M. Mir
DOI related publication
https://doi.org/10.1007/s00521-020-04740-x
More Info
expand_more
Publication Year
2020
Language
English
Copyright
© 2020 Jalal A. Nasiri, S.A.M. Mir
Research Group
Software Engineering
Issue number
16
Volume number
32
Pages (from-to)
12949-12969
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Among the extensions of twin support vector machine (TSVM), some scholars have utilized K-nearest neighbor (KNN) graph to enhance TSVM’s classification accuracy. However, these KNN-based TSVM classifiers have two major issues such as high computational cost and overfitting. In order to address these issues, this paper presents an enhanced regularized K-nearest neighbor-based twin support vector machine (RKNN-TSVM). It has three additional advantages: (1) Weight is given to each sample by considering the distance from its nearest neighbors. This further reduces the effect of noise and outliers on the output model. (2) An extra stabilizer term was added to each objective function. As a result, the learning rules of the proposed method are stable. (3) To reduce the computational cost of finding KNNs for all the samples, location difference of multiple distances-based K-nearest neighbors algorithm (LDMDBA) was embedded into the learning process of the proposed method. The extensive experimental results on several synthetic and benchmark datasets show the effectiveness of our proposed RKNN-TSVM in both classification accuracy and computational time. Moreover, the largest speedup in the proposed method reaches to 14 times.

Files

Manuscript_NCA_Mir.pdf
(pdf | 4.42 Mb)
- Embargo expired in 01-02-2021
License info not available