TY - GEN
T1 - On Source Dependency Models for Reliable Social Sensing
T2 - 36th IEEE International Conference on Distributed Computing Systems, ICDCS 2016
AU - Yao, Shuochao
AU - Hu, Shaohan
AU - Li, Shen
AU - Zhao, Yiran
AU - Su, Lu
AU - Kaplan, Lance
AU - Yener, Aylin
AU - Abdelzaher, Tarek
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/8
Y1 - 2016/8/8
N2 - This paper develops a simplified dependency model for sources on social networks that is shown to improve the quality of fact-finding - assessing veracity of observations shared on social media. Recent literature developed a mathematical approach for exploiting social networks, such as Twitter, as noisy sensor networks that report observations on the state of the physical world. It was shown that the quality of state estimation from such noisy data, known as fact-finding, was a function of assumptions made regarding the independence of sources or lack thereof. When sources propagate information they hear from others (without verification), correlated errors may arise that degrade fact-finding performance. This work advances the state of the art by developing a simplified model of dependencies between sources and designing an improved dependency-aware estimator to assess veracity of observations, taking into account the observed dependency structure. A fundamental error bound is derived for this estimator to understand the gap in its performance from optimal. It is shown that the new estimator outperforms state of the art fact-finders and, in some cases, yields an accuracy close to the fundamental error bound.
AB - This paper develops a simplified dependency model for sources on social networks that is shown to improve the quality of fact-finding - assessing veracity of observations shared on social media. Recent literature developed a mathematical approach for exploiting social networks, such as Twitter, as noisy sensor networks that report observations on the state of the physical world. It was shown that the quality of state estimation from such noisy data, known as fact-finding, was a function of assumptions made regarding the independence of sources or lack thereof. When sources propagate information they hear from others (without verification), correlated errors may arise that degrade fact-finding performance. This work advances the state of the art by developing a simplified model of dependencies between sources and designing an improved dependency-aware estimator to assess veracity of observations, taking into account the observed dependency structure. A fundamental error bound is derived for this estimator to understand the gap in its performance from optimal. It is shown that the new estimator outperforms state of the art fact-finders and, in some cases, yields an accuracy close to the fundamental error bound.
UR - https://www.scopus.com/pages/publications/84985914755
UR - https://www.scopus.com/pages/publications/84985914755#tab=citedBy
U2 - 10.1109/ICDCS.2016.75
DO - 10.1109/ICDCS.2016.75
M3 - Conference contribution
AN - SCOPUS:84985914755
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 467
EP - 476
BT - Proceedings - 2016 IEEE 36th International Conference on Distributed Computing Systems, ICDCS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 27 June 2016 through 30 June 2016
ER -