Automatic Selection of Learning Bias for Active Sampling

Davi Pereira dos Santos, A. Carvalho
{"title":"Automatic Selection of Learning Bias for Active Sampling","authors":"Davi Pereira dos Santos, A. Carvalho","doi":"10.1109/BRACIS.2016.021","DOIUrl":null,"url":null,"abstract":"The classification task, when performed by machine learning algorithms, requires previous training on labeled instances. In many applications, the data labeling process is expensive and can affect the predictive performance of classification models. A current solution has been the use of active learning, which investigates strategies for data labeling. Its main goal is to decide which instances should be labeled and added to the training set, reducing the overall labeling costs. However, the strategy normally depends on a learning algorithm, which should be chosen by a machine learning specialist - usually based on a cross-validation procedure. Consequently, there is a deadlock: without the complete training set, the algorithm that will present the best learning curve cannot be known in advance. Ideally, some type of automatic selection should be employed to solve this deadlock. This study investigates the use of meta-learning for automatic algorithm selection in active learning tasks. Experimental results show that meta-learning is able to find correspondences between algorithms and dataset features in order to help active learning to reduce the risks of incurring in unexpected labeling costs.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2016.021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The classification task, when performed by machine learning algorithms, requires previous training on labeled instances. In many applications, the data labeling process is expensive and can affect the predictive performance of classification models. A current solution has been the use of active learning, which investigates strategies for data labeling. Its main goal is to decide which instances should be labeled and added to the training set, reducing the overall labeling costs. However, the strategy normally depends on a learning algorithm, which should be chosen by a machine learning specialist - usually based on a cross-validation procedure. Consequently, there is a deadlock: without the complete training set, the algorithm that will present the best learning curve cannot be known in advance. Ideally, some type of automatic selection should be employed to solve this deadlock. This study investigates the use of meta-learning for automatic algorithm selection in active learning tasks. Experimental results show that meta-learning is able to find correspondences between algorithms and dataset features in order to help active learning to reduce the risks of incurring in unexpected labeling costs.
主动抽样中学习偏差的自动选择
当由机器学习算法执行分类任务时,需要事先对标记实例进行训练。在许多应用中,数据标注过程是昂贵的,并且会影响分类模型的预测性能。目前的解决方案是使用主动学习,它研究数据标记的策略。它的主要目标是决定哪些实例应该被标记并添加到训练集中,从而降低总体标记成本。然而,该策略通常取决于学习算法,而学习算法应该由机器学习专家选择——通常基于交叉验证过程。这样就出现了死锁:没有完整的训练集,就无法提前知道将呈现最佳学习曲线的算法。理想情况下,应该采用某种类型的自动选择来解决这种死锁。本研究探讨了元学习在主动学习任务中自动算法选择的应用。实验结果表明,元学习能够找到算法和数据集特征之间的对应关系,从而帮助主动学习降低产生意外标注成本的风险。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信