.png){kind=icon}
返回
Subspace-based support vector machines for pattern classification
.png){kind=icon}
OA
AI
DOI：10.1016/j.neunet.2009.06.026.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we discuss subspace-based support vector machines (SS-SVMs), in which an input vector is classified into the class with the maximum similarity. Namely, for each class we define the weighted similarity measure using the vectors called dictionaries that represent the class, and optimize the weights so that the margin between classes is maximized. Because the similarity measure is defined for each class, for a data sample the similarity measure to which the data sample belongs needs to be the largest among all the similarity measures. Introducing slack variables, we define these constraints either by equality constraints or inequality constraints. As a result we obtain subspace-based least squares SVMs (SSLS-SVMs) and subspace-based linear programming SVMs (SSLP-SVMs). To speed up training of SSLS-SVMs, which are similar to LS-SVMs by all-at-once formulation, we also propose SSLS-SVMs by one-against-all formulation, which optimize each similarity measure separately. Using two-class problems, we clarify the difference of SSLS-SVMs and SSLP-SVMs and evaluate the effectiveness of the proposed methods over the conventional methods with equal weights and with weights equal to eigenvalues. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Kernel methods
Least squares
Linear programming
Subspace-based methods
Support vector machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.8K
被引数:
3.0W
机构
引用论文
.png){kind=icon}
Evaluation and selection of 3PL provider using fuzzy AHP and grey TOPSIS in group decision making
OAAI
OAAI分享收藏 没有更多内容
没有更多内容