社会传感应用中硬度感知的真相发现

Jermaine Marshall, Munira Syed, Dong Wang
{"title":"社会传感应用中硬度感知的真相发现","authors":"Jermaine Marshall, Munira Syed, Dong Wang","doi":"10.1109/DCOSS.2016.9","DOIUrl":null,"url":null,"abstract":"This paper develops a new principled framework to solve a hardness-aware truth discovery problem in social sensing applications. Social sensing has emerged as a new application paradigm where a large crowd of social sensors (humansor devices on their behalf) are recruited to or voluntarily report observations about the physical environment at scale. These observations may be either true or false, and hence are viewed as binary claims. A fundamental problem in social sensing applications lies in ascertaining the correctness of claims and the reliability of data sources. We refer to this problem as truth discovery. Significant efforts were made to address the truth discovery problem, but an important dimension of the problem has not been fully exploited: hardness of claims (how challenging a claim is to be made). A common assumption made in the previous work is that they assumed all claims areof the same degree of hardness. However, in real world social sensing applications, simply ignoring the hardness differences between claims could easily lead to suboptimal truth discovery results. In this paper, we develop a new hardness-aware truth discovery scheme that explicitly considers different hardness degrees of claims into a rigorous analytical framework. The new truth discovery scheme solves a maximum likelihood estimation problem to determine both the claim correctness and the source reliability. We compare our hardness-aware scheme with the state-of-the-art baselines through three real world case studies(Baltimore Riots, Paris Attack and Oregon Shootings, all in 2015) using Twitter data feeds. The evaluation results showed that our new scheme outperforms all compared baselines and significantly improves the truth discovery accuracy in social sensing applications.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Hardness-Aware Truth Discovery in Social Sensing Applications\",\"authors\":\"Jermaine Marshall, Munira Syed, Dong Wang\",\"doi\":\"10.1109/DCOSS.2016.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper develops a new principled framework to solve a hardness-aware truth discovery problem in social sensing applications. Social sensing has emerged as a new application paradigm where a large crowd of social sensors (humansor devices on their behalf) are recruited to or voluntarily report observations about the physical environment at scale. These observations may be either true or false, and hence are viewed as binary claims. A fundamental problem in social sensing applications lies in ascertaining the correctness of claims and the reliability of data sources. We refer to this problem as truth discovery. Significant efforts were made to address the truth discovery problem, but an important dimension of the problem has not been fully exploited: hardness of claims (how challenging a claim is to be made). A common assumption made in the previous work is that they assumed all claims areof the same degree of hardness. However, in real world social sensing applications, simply ignoring the hardness differences between claims could easily lead to suboptimal truth discovery results. In this paper, we develop a new hardness-aware truth discovery scheme that explicitly considers different hardness degrees of claims into a rigorous analytical framework. The new truth discovery scheme solves a maximum likelihood estimation problem to determine both the claim correctness and the source reliability. We compare our hardness-aware scheme with the state-of-the-art baselines through three real world case studies(Baltimore Riots, Paris Attack and Oregon Shootings, all in 2015) using Twitter data feeds. The evaluation results showed that our new scheme outperforms all compared baselines and significantly improves the truth discovery accuracy in social sensing applications.\",\"PeriodicalId\":217448,\"journal\":{\"name\":\"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCOSS.2016.9\",\"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 International Conference on Distributed Computing in Sensor Systems (DCOSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2016.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

本文提出了一种新的原则框架,用于解决社会传感应用中硬度感知的真值发现问题。社会传感已经成为一种新的应用范例,在这种范例中,大量的社会传感器(代表它们的人类或设备)被招募来或自愿地大规模报告对物理环境的观察。这些观察可能是对的,也可能是错的,因此被视为二元主张。社会传感应用中的一个基本问题在于确定声明的正确性和数据源的可靠性。我们把这个问题称为真理发现。人们在解决发现真相的问题上做出了巨大的努力,但这个问题的一个重要方面还没有得到充分利用:主张的硬度(提出一个主张的挑战程度)。在以前的工作中,一个常见的假设是,他们假设所有的索赔都具有相同的硬度。然而,在现实世界的社会传感应用中,简单地忽略权利要求之间的硬度差异很容易导致次优的真值发现结果。在本文中,我们开发了一种新的硬度感知真值发现方案,该方案明确地将不同硬度要求考虑到一个严格的分析框架中。新的真值发现方案解决了最大似然估计问题,以确定声明的正确性和源的可靠性。我们通过三个真实世界的案例研究(巴尔的摩骚乱、巴黎袭击和俄勒冈枪击事件,都发生在2015年),将我们的硬度感知方案与最新的基线进行比较。评估结果表明,我们的新方案优于所有比较基线,并显着提高了社会传感应用中的真相发现精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hardness-Aware Truth Discovery in Social Sensing Applications
This paper develops a new principled framework to solve a hardness-aware truth discovery problem in social sensing applications. Social sensing has emerged as a new application paradigm where a large crowd of social sensors (humansor devices on their behalf) are recruited to or voluntarily report observations about the physical environment at scale. These observations may be either true or false, and hence are viewed as binary claims. A fundamental problem in social sensing applications lies in ascertaining the correctness of claims and the reliability of data sources. We refer to this problem as truth discovery. Significant efforts were made to address the truth discovery problem, but an important dimension of the problem has not been fully exploited: hardness of claims (how challenging a claim is to be made). A common assumption made in the previous work is that they assumed all claims areof the same degree of hardness. However, in real world social sensing applications, simply ignoring the hardness differences between claims could easily lead to suboptimal truth discovery results. In this paper, we develop a new hardness-aware truth discovery scheme that explicitly considers different hardness degrees of claims into a rigorous analytical framework. The new truth discovery scheme solves a maximum likelihood estimation problem to determine both the claim correctness and the source reliability. We compare our hardness-aware scheme with the state-of-the-art baselines through three real world case studies(Baltimore Riots, Paris Attack and Oregon Shootings, all in 2015) using Twitter data feeds. The evaluation results showed that our new scheme outperforms all compared baselines and significantly improves the truth discovery accuracy in social sensing applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信