Frustratingly Easy Truth Discovery

被引:0
|
作者
Meir, Reshef [1 ]
Amir, Ofra [1 ]
Ben-Porat, Omer [1 ]
Ben-Shabat, Tsviel [1 ]
Cohensius, Gal [1 ]
Xia, Lirong [2 ]
机构
[1] Technion Israel Inst Technol, Haifa, Israel
[2] Rensselaer Polytech Inst, Troy, NY USA
基金
以色列科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Truth discovery is a general name for a broad range of statistical methods aimed to extract the correct answers to questions, based on multiple answers coming from noisy sources. For example, workers in a crowdsourcing platform. In this paper, we consider an extremely simple heuristic for estimating workers' competence using average proximity to other workers. We prove that this estimates well the actual competence level and enables separating high and low quality workers in a wide spectrum of domains and statistical models. Under Gaussian noise, this simple estimate is the unique solution to the Maximum Likelihood Estimator with a constant regularization factor. Finally, weighing workers according to their average proximity in a crowdsourcing setting, results in substantial improvement over unweighted aggregation and other truth discovery algorithms in practice.
引用
收藏
页码:6074 / 6083
页数:10
相关论文
共 50 条
  • [1] Frustratingly Easy Transferability Estimation
    Huang, Long-Kai
    Huang, Junzhou
    Rong, Yu
    Yang, Qiang
    Wei, Ying
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [2] Return of Frustratingly Easy Domain Adaptation
    Sun, Baochen
    Feng, Jiashi
    Saenko, Kate
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 2058 - 2065
  • [3] Frustratingly Easy NBNN Domain Adaptation
    Tommasi, Tatiana
    Caputo, Barbara
    2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 897 - 904
  • [4] FIXED: Frustratingly Easy Domain Generalization with Mixup
    Lu, Wang
    Wang, Jindong
    Yu, Han
    Huang, Lei
    Zhang, Xiang
    Chen, Yiqiang
    Xie, Xing
    CONFERENCE ON PARSIMONY AND LEARNING, VOL 234, 2024, 234 : 159 - 178
  • [5] Frustratingly Easy Model Ensemble for Abstractive Summarization
    Kobayashi, Hayato
    2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), 2018, : 4165 - 4176
  • [6] Frustratingly Easy Cross-Modal Hashing
    Ma, Dekui
    Liang, Jian
    Kong, Xiangwei
    He, Ran
    MM'16: PROCEEDINGS OF THE 2016 ACM MULTIMEDIA CONFERENCE, 2016, : 237 - 241
  • [7] A Frustratingly Easy Approach for Entity and Relation Extraction
    Zhong, Zexuan
    Chen, Danqi
    2021 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL-HLT 2021), 2021, : 50 - 61
  • [8] Frustratingly Easy Multilingual Grapheme-to-Phoneme Conversion
    Prabhu, Nikhil
    Kann, Katharina
    17TH SIGMORPHON WORKSHOP ON COMPUTATIONAL RESEARCH IN PHONETICS PHONOLOGY, AND MORPHOLOGY (SIGMORPHON 2020), 2020, : 123 - 127
  • [9] Frustratingly Easy System Combination for Grammatical Error Correction
    Qorib, Muhammad Reza
    Na, Seung-Hoon
    Ng, Hwee Tou
    NAACL 2022: THE 2022 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES, 2022, : 1964 - 1974
  • [10] A frustratingly easy way of extracting political networks from text
    Bro, Naim
    PLOS ONE, 2025, 20 (01):