A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis

Xin Yan, Hongmiao Zhu and Jian Luo ()
Additional contact information
Xin Yan: Shanghai University of International Business and Economics
Hongmiao Zhu: Shanghai University of International Business and Economics
Jian Luo: Dongbei University of Finance and Economics

Journal of Combinatorial Optimization, 2021, vol. 42, issue 4, No 17, 948-965

Abstract: Abstract Semi-supervised classification methods are widely-used and attractive for dealing with both labeled and unlabeled data in real-world problems. In this paper, a novel kernel-free Laplacian twin support vector machine method is proposed for semi-supervised classification. Its main idea is to classify data points into two classes by constructing two nonparallel quadratic surfaces so that each surface is close to one class of points and far away from the other class of points. The proposed method not only saves much computational time by avoiding choosing a kernel function and its related parameters in the classical support vector machine, but also addresses the issue of computational complexity by adopting manifold regularization technique. Moreover, two small-sized convex quadratic programming problems need to be solved to implement the proposed method, which is much easier than solving the non-convex problem of mixed integer programming to implement the well-known semi-supervised support vector machine. Finally, the numerical results on some artificial and benchmark data sets validate the competitive performance of proposed method in terms of efficiency, classification accuracy and generalization ability, by comparing to well-known semi-supervised methods. In particular, the proposed method handles five benchmarking disease diagnosis problems well and efficiently, which indicates the potential of proposed method in diagnosing and forecasting the diseases.

Keywords: Support vector machine; Kernel-free; Quadratic surface; Semi-supervised classification; Disease diagnosis (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00484-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:42:y:2021:i:4:d:10.1007_s10878-019-00484-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00484-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().