期刊
PATTERN RECOGNITION LETTERS
卷 29, 期 13, 页码 1842-1848出版社
ELSEVIER
DOI: 10.1016/j.patrec.2008.05.016
关键词
support vector machines; pattern recognition; twin support vector machines
This paper enhances the recently proposed twin SVM Jayadeva et al. [Jayadeva, Khemchandani, R., Chandra, S., 2007. Twin support vector machines for pattern classification. IEEE Trans. Pattern Anal. Machine Intell. 29 (5), 905-910] using smoothing techniques to smooth twin SVM for binary classification. We attempt to solve the primal quadratic programming problems of twin SVM by converting them into smooth unconstrained minimization problems. The smooth reformulations are solved using the well-known Newton-Armijo algorithm. The effectiveness of the enhanced method is demonstrated by experimental results on available benchmark datasets. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据