.png){kind=icon}
返回
Fast and simple gradient-based optimization for semi-supervised support vector machines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.12.056.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the main learning tasks in machine learning is the one of classifying data items. The basis for such a task is usually a training set consisting of labeled patterns. In real-world settings, however, such labeled data are usually scarce, and the corresponding models might yield unsatisfying results. Unlabeled data, on the other hand, can often be obtained in huge quantities without much additional effort. A prominent research direction in the field of machine learning is semi-supervised support vector machines. This type of binary classification approach aims at taking the additional information provided by the unlabeled patterns into account to reveal more information about the structure of the data at hand. In some cases, this can yield significantly better classification results compared to a straightforward application of supervised models. One drawback, however, is the fact that generating such models requires solving difficult non-convex optimization tasks. In this work, we present a simple but effective gradient-based optimization framework to address the induced problems. The resulting method can be implemented easily using black-box optimization engines and yields excellent classification and runtime results on both sparse and non-sparse data sets. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Semi-supervised support vector machines
Non-convex optimization
Quasi-Newton methods
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Mechanism Analysis of Roadway Rockbursts Induced by Dynamic Mining Loading and Its Application.png)
Energies
OAAI
EnergiesIF0
OAAI分享收藏
查看更多内容