Optimizing Source Selection in Social Sensing in the Presence of Influence Graphs

Huajie Shao, Shiguang Wang, Shen Li, Shuochao Yao, Yiran Zhao, Md. Tanvir Al Amin, T. Abdelzaher, Lance M. Kaplan
{"title":"Optimizing Source Selection in Social Sensing in the Presence of Influence Graphs","authors":"Huajie Shao, Shiguang Wang, Shen Li, Shuochao Yao, Yiran Zhao, Md. Tanvir Al Amin, T. Abdelzaher, Lance M. Kaplan","doi":"10.1109/ICDCS.2017.275","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of choosing the right sources to solicit data from in sensing applications involving broadcast channels, such as those crowdsensing applications where sources share their observations on social media. The goal is to select sources such that expected fusion error is minimized. We assume that soliciting data from a source incurs a cost and that the cost budget is limited. Contrary to other formulations of this problem, we focus on the case where some sources influence others. Hence, asking a source to make a claim affects the behavior of other sources as well, according to an influence model. The paper makes two contributions. First, we develop an analytic model for estimating expected fusion error, given a particular influence graph and solution to the source selection problem. Second, we use that model to search for a solution that minimizes expected fusion error, formulating it as a zero-one integer non-linear programming (INLP) problem. To scale the approach, the paper further proposes a novel reliability-based pruning heuristic (RPH) and a similarity-based lossy estimation (SLE) algorithm that significantly reduce the complexity of the INLP algorithm at the cost of a modest approximation. The analytically computed expected fusion error is validated using both simulations and real-world data from Twitter, demonstrating a good match between analytic predictions and empirical measurements. It is also shown that our method outperforms baselines in terms of resulting fusion error.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2017.275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper addresses the problem of choosing the right sources to solicit data from in sensing applications involving broadcast channels, such as those crowdsensing applications where sources share their observations on social media. The goal is to select sources such that expected fusion error is minimized. We assume that soliciting data from a source incurs a cost and that the cost budget is limited. Contrary to other formulations of this problem, we focus on the case where some sources influence others. Hence, asking a source to make a claim affects the behavior of other sources as well, according to an influence model. The paper makes two contributions. First, we develop an analytic model for estimating expected fusion error, given a particular influence graph and solution to the source selection problem. Second, we use that model to search for a solution that minimizes expected fusion error, formulating it as a zero-one integer non-linear programming (INLP) problem. To scale the approach, the paper further proposes a novel reliability-based pruning heuristic (RPH) and a similarity-based lossy estimation (SLE) algorithm that significantly reduce the complexity of the INLP algorithm at the cost of a modest approximation. The analytically computed expected fusion error is validated using both simulations and real-world data from Twitter, demonstrating a good match between analytic predictions and empirical measurements. It is also shown that our method outperforms baselines in terms of resulting fusion error.
影响图存在下的社会感知源选择优化
本文解决了在涉及广播频道的传感应用中选择合适的数据源来获取数据的问题,例如那些在社交媒体上分享其观察结果的众测应用。目标是选择这样的源,使预期的聚变误差最小。我们假设从一个数据源获取数据会产生成本,并且成本预算是有限的。与这个问题的其他表述相反,我们关注的是一些来源影响其他来源的情况。因此,根据影响模型,要求消息来源提出索赔也会影响其他消息来源的行为。这篇论文有两个贡献。首先,我们建立了一个估计预期融合误差的分析模型,给出了一个特定的影响图和源选择问题的解决方案。其次,我们使用该模型来寻找最小化预期融合误差的解决方案,将其表述为一个0 - 1整数非线性规划(INLP)问题。为了扩展该方法,本文进一步提出了一种新的基于可靠性的剪枝启发式(RPH)和基于相似性的有损估计(SLE)算法,以适度近似为代价显著降低了INLP算法的复杂性。分析计算的预期融合误差通过模拟和来自Twitter的实际数据进行验证,证明了分析预测与经验测量之间的良好匹配。结果还表明,我们的方法在产生的融合误差方面优于基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信