상세 보기
Possibilistic support vector machines
- Lee, K.;
- Kim, Dae-Won;
- Lee, K.H.;
- Lee, D.
Citations
WEB OF SCIENCE
8Citations
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.
키워드
classification; support vector machines; possibilistic SVMs; geometric distribution; possibilistic distance
- 제목
- Possibilistic support vector machines
- 저자
- Lee, K.; Kim, Dae-Won; Lee, K.H.; Lee, D.
- 발행일
- 2005-08
- 유형
- Article
- 권
- 38
- 호
- 8
- 페이지
- 1325 ~ 1327