.png){kind=icon}
返回
A new maximum margin algorithm for one-class problems and its boosting implementation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2004.10.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, each one-class problem is regarded as trying to estimate a function that is positive on a desired slab and negative on the complement. The main advantage of this viewpoint is that the loss function and the expected risk can be defined to ensure that the slab can contain as many samples as possible. Inspired by the nature of SVMs, the intuitive margin is also defined. As a result, a new linear optimization problem to maximize the margin and some theoretically motivated learning algorithms are obtained. Moreover, the proposed algorithms can be implemented by boosting techniques to solve nonlinear one-class classifications. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
one-class problems
outliers
statistical learning theory
support vector machines
margin
boosting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
没有更多内容
没有更多内容