.png){kind=icon}
返回
Unconstrained large margin distribution machines
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2017.09.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Large margin distribution machines (LDMs) maximize the margin mean and minimize the margin variance, and show good generalization performance compared to support vector machines (SVMs). But because two additional hyperparameters are necessary, model selection needs more time. In this paper we propose unconstrained large margin distribution machines (ULDMs). In the ULDM, the objective function is the sum of the margin mean (a linear term), the margin variance (a quadratic term), and the weighted regularization term (a quadratic term), and constraints are not included. Therefore, the solution is expressed by a set of linear equations with one hyperparameter for the regularization term. Theoretical analysis proves that the decision boundary between two classes passes through the mean of all mapped training data if the numbers of training data of both classes are the same. The case where the numbers are different is analyzed for a one-dimensional input and how the decision boundary is determined is clarified. Using benchmark data sets, we show that the generalization performance of ULDMs is comparable to or better than that of SVMs. (C) 2017 Elsevier B. V. All rights reserved.
Keyword:
Large margin distribution machines
Pattern classification
Coordinate descent
Support vector machines
Training
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
分享收藏分享收藏Parsimonious Mahalanobis kernel for the classification of high dimensional data用于高维数据分类的简约马氏核.png)
PATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting在线学习的决策理论概括及其在Boosting中的应用OAAI
OAAI分享收藏
查看更多内容