期刊
INFORMATION SCIENCES
卷 180, 期 20, 页码 3863-3875出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2010.06.039
关键词
Pattern recognition; Twin support vector machine; Geometric interpretation; Geometric algorithm; Probabilistic speed-up strategy
资金
- Shanghai Leading Academic Discipline Project [S30405]
- Natural Science Foundation of Shanghai Normal University [SK200937]
In this paper, a v-twin support vector machine (v-TSVM) is presented, improving upon the recently proposed twin support vector machine (TSVM). This v-TSVM introduces a pair of parameters (v) to control the bounds of the fractions of the support vectors and the error margins. The theoretical analysis shows that this v-TSVM can be interpreted as a pair of minimum generalized Mahalanobis-norm problems on two reduced convex hulls (RCHs). Based on the well-known Gilbert's algorithm, a geometric algorithm for TSVM (GA-TSVM) and its probabilistic speed-up version, named PGA-TSVM, are presented. Computational results on several synthetic as well as benchmark datasets demonstrate the significant advantages of the proposed algorithms in terms of both computation complexity and classification accuracy. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据