Quadratic kernel-free least squares support vector machine for target diseases classification

Yanqin Bai (), Xiao Han (), Tong Chen () and Hua Yu ()
Additional contact information
Yanqin Bai: Shanghai University
Xiao Han: Shanghai University
Tong Chen: Shanghai Jiaotong University
Hua Yu: Shanghai Jiaotong University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 3, 850-870

Abstract: Abstract Support vector machines (SVMs) have been proved effective and promising techniques for classification problem. Recently, SVMs have been successfully applied to target diseases classification and prediction by using real-world data. In this paper, we propose a new quadratic kernel-free least squares support vector machine (QLSSVM) for binary classification problem. The model of QLSSVM is a convex quadratic programming problem with an advantage of kernel-free, compared with the existed least squares SVM. By using consensus technique, the decision variables of QLSSVM are split into local variable and global variable. Then the QLSSVM is converted into the consensus QLSSVM and solved by alternating direction method of multipliers with a Gaussian back substitution. Finally, our QLSSVM is illustrated in terms of numerical tests based on two types of training data sets. The first numerical test is implemented based on artificial data to certify the performance of our QLSSVM. To apply our QLSSVM to disease classification, the second one is implemented based on diseases data set from University of California, Irvine, Machine Learning Repository to demonstrates that our model has higher classification accuracy compared with several existed methods. In particularly, our numerical example is implemented based on a special heart disease data set provided by Hungarian heart disease database to illustrates the effectiveness of our QLSSVM for a particular disease diagnosis.

Keywords: Classification problem; Least squares support vector machine; Consensus; Quadratic kernel-free least squares support vector machine; Alternating direction method of multipliers (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9848-z 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:30:y:2015:i:4:d:10.1007_s10878-015-9848-z

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

DOI: 10.1007/s10878-015-9848-z

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 ().