稳健的基于众包的线性回归

Saeid Abbaasi, M. Mohammadi, Ehsan Shams Davodly
{"title":"稳健的基于众包的线性回归","authors":"Saeid Abbaasi, M. Mohammadi, Ehsan Shams Davodly","doi":"10.1109/ICCKE.2016.7802130","DOIUrl":null,"url":null,"abstract":"In most machine learning problems, the labeling of the training data is an expensive or even impossible task. Crowdsourcing-based learning uses uncertain labels from many non-expert annotators instead of one reference label. Crowdsourcing based linear regression is an efficient way for function estimation when many labels are available for each instance. However, methods in literature have a poor performance against large noise and outliers in labels. To tackle this problem, we proposed a novel robust crowdsourcing-based linear regression derived from information theoretic learning. The proposed problem is not convex, but it can be efficiently solved by half quadratic programming. The proposed model has a close relation with weighted crowdsourcing-based linear regression, in which labels of each annotator weight adaptively and iteratively. The Performance of the proposed method evaluated on several artificial data sets in different circumstances. Experimental Results demonstrate the efficacy and robustness of the proposed method.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust crowdsourcing-based linear regression\",\"authors\":\"Saeid Abbaasi, M. Mohammadi, Ehsan Shams Davodly\",\"doi\":\"10.1109/ICCKE.2016.7802130\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In most machine learning problems, the labeling of the training data is an expensive or even impossible task. Crowdsourcing-based learning uses uncertain labels from many non-expert annotators instead of one reference label. Crowdsourcing based linear regression is an efficient way for function estimation when many labels are available for each instance. However, methods in literature have a poor performance against large noise and outliers in labels. To tackle this problem, we proposed a novel robust crowdsourcing-based linear regression derived from information theoretic learning. The proposed problem is not convex, but it can be efficiently solved by half quadratic programming. The proposed model has a close relation with weighted crowdsourcing-based linear regression, in which labels of each annotator weight adaptively and iteratively. The Performance of the proposed method evaluated on several artificial data sets in different circumstances. Experimental Results demonstrate the efficacy and robustness of the proposed method.\",\"PeriodicalId\":205768,\"journal\":{\"name\":\"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE.2016.7802130\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2016.7802130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在大多数机器学习问题中,标记训练数据是一项昂贵甚至不可能完成的任务。基于众包的学习使用来自许多非专业注释者的不确定标签,而不是一个参考标签。当每个实例都有许多标签可用时,基于众包的线性回归是一种有效的函数估计方法。然而,文献中的方法对标签中的大噪声和异常值的性能较差。为了解决这个问题,我们提出了一种基于信息论学习的鲁棒的基于众包的线性回归。所提出的问题不是凸的,但可以用半二次规划有效地求解。该模型与基于加权众包的线性回归密切相关,其中每个注释器的标签自适应迭代加权。在不同情况下的几个人工数据集上对该方法的性能进行了评估。实验结果证明了该方法的有效性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust crowdsourcing-based linear regression
In most machine learning problems, the labeling of the training data is an expensive or even impossible task. Crowdsourcing-based learning uses uncertain labels from many non-expert annotators instead of one reference label. Crowdsourcing based linear regression is an efficient way for function estimation when many labels are available for each instance. However, methods in literature have a poor performance against large noise and outliers in labels. To tackle this problem, we proposed a novel robust crowdsourcing-based linear regression derived from information theoretic learning. The proposed problem is not convex, but it can be efficiently solved by half quadratic programming. The proposed model has a close relation with weighted crowdsourcing-based linear regression, in which labels of each annotator weight adaptively and iteratively. The Performance of the proposed method evaluated on several artificial data sets in different circumstances. Experimental Results demonstrate the efficacy and robustness of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信