.png){kind=icon}
返回
Incremental margin algorithm for large margin classifiers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2007.05.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this contribution, we introduce a new on-line approximate maximal margin learning algorithm based on an extension of the perceptron algorithm. This extension, which we call fixed margin perceptron (FMP), finds the solution of a linearly separable learning problem given a fixed margin. It is shown that this algorithm converges in (R-2 - gamma(2)(f))/(gamma* -gamma)(2) updates, where gamma(f) < y* is the fixed margin, gamma* is the optimum margin and R is the radius of the ball that circumscribes the data. The incremental margin algorithm (IMA) approximates the large margin solution by successively using FMP with increasing margin values. This incremental approach always guarantees a good solution at hands. Also, it is easy to implement and avoids quadratic programming methods. IMA was tested using several different data sets and it yields results similar to those found by an SVM. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
perceptron algorithm
large margin classifiers
kernel methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Tunable N2 Fixation Enabled by Ferroelectric Switching in Doped Graphene/In2Se3 Dual-Atom Catalysts通过铁电开关实现的掺杂石墨烯/In2Se3双原子催化剂的可调N2固定
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容