Possibilistic support vector machines

Citations

WEB OF SCIENCE

8
Citations

SCOPUS

13

초록

We propose new support vector machines (SVMs) that incorporate the geometric distribution of an input data set by associating each data point with a possibilistic membership, which measures the relative strength of the self class membership. By using a possibilistic distance measure based on the possibilistic membership, we reformulate conventional SVMs in three ways. The proposed methods are shown to have better classification performance than conventional SVMs in various tests. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

키워드

classificationsupport vector machinespossibilistic SVMsgeometric distributionpossibilistic distance
제목
Possibilistic support vector machines
저자
Lee, K.Kim, Dae-WonLee, K.H.Lee, D.
DOI
10.1016/j.patcog.2004.11.018
발행일
2005-08
유형
Article
저널명
Pattern Recognition
38
8
페이지
1325 ~ 1327