0


活跃的抽样等级学习优化估计损失减少

Optimizing Estimated Loss Reduction for Active Sampling in Rank Learning
课程网址: http://videolectures.net/icml08_donmez_oelr/  
主讲教师: Pinar Donmez
开课单位: 卡内基梅隆大学
开课时间: 2008-08-29
课程语种: 英语
中文简介:
学习排名正在成为机器学习中越来越受欢迎的研究领域。排序问题的目的是在输入空间中的一组实例之间产生排序或偏好关系。然而,在许多排名应用程序中,收集标签数据越来越成为一种负担,因为标签需要在一组备选方案上引出相对顺序。本文提出了一种新的基于支持向量机的主动学习框架和基于提升的秩学习框架。我们的方法建议抽样基于最大估计损失差异超过未标记的数据。在两个基准语料库上的实验结果表明,该模型大大减少了标记的工作量,并且快速实现了优异的性能,与基于边际的抽样基线相比,相对提高了30%。
课程简介: Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of instances in the input space. However, collecting labeled data is growing into a burden in many rank applications since labeling requires eliciting the relative ordering over the set of alternatives. In this paper, we propose a novel active learning framework for SVM-based and boosting-based rank learning. Our approach suggests sampling based on maximizing the estimated loss differential over unlabeled data. Experimental results on two benchmark corpora show that the proposed model substantially reduces the labeling effort, and achieves superior performance rapidly with as much as 30% relative improvement over the margin-based sampling baseline.
关 键 词: 计算机科学; 机器学习; 学习排名
课程来源: 视频讲座网
最后编审: 2019-11-28:cwx
阅读次数: 23