返回
Boosting with pairwise constraints
DOI:10.1016/j.neucom.2009.09.013.png)
摘要
En 中文
In supervised learning tasks, boosting can combine multiple weak learners into a stronger one. AdaBoost is one of the most popular boosting algorithms, which is widely used and stimulates extensive research efforts in the boosting research community. Different from supervised learning, semi-supervised learning aims to make full use of both labeled and unlabeled data to improve learning performance, and has drawn considerable interests in both research and applications. To harness the power of boosting, it is important and interesting to extend AdaBoost to semi-supervised scenarios. Moreover, in semi-supervised learning, it is believed that incorporating pairwise constraints such as side-information is promising to obtain more satisfiable results. However. how to extend AdaBoost with pairwise constraints remains an open problem. In this paper, we propose a novel framework to solve this problem based on the gradient descent view of boosting. The proposed framework is almost as simple and flexible as AdaBoost, and can be readily applied in the presence of pairwise constraints. We present theoretical results, show possible further extensions, and validate the effectiveness via experiments. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Boosting
Pairwise constraints
Classifier ensemble
Semi-supervised learning
Gradient descent boosting
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Boosted learning in dynamic Bayesian networks for Multimodal speaker detection
PROCEEDINGS OF THE IEEE
IF25.9
Fluorescent Nanostructures from Aromatic Diblock Copolymers via Atom Transfer Radical Polymerization
Predictors of Compliance with the Postpartum Visit among Women Living in Healthy Start Project Areas
Stress During Pregnancy and the Development of Diseases in the offspring: A Systematic-Review and Meta-Analysis
Midwifery
IF0

