TY - JOUR
T1 - Online Auditing of Information Flow
AU - Oren-Loberman, Mor
AU - Azar, Vered
AU - Huleihel, Wasim
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2024
Y1 - 2024
N2 - Modern social media platforms play an important role in facilitating rapid dissemination of information through their massive user networks. Fake news, misinformation, and unverifiable facts on social media platforms propagate disharmony and affect society. In this paper, we consider the problem of online auditing of information flow/propagation with the goal of classifying news items as fake or genuine. Specifically, driven by experiential studies on real-world social media platforms, we propose a probabilistic Markovian information spread model over networks modeled by graphs. We then formulate our inference task as a certain sequential detection problem with the goal of minimizing the combination of the error probability and the time it takes to achieve the correct decision. For this model, we find the optimal detection algorithm minimizing the aforementioned risk and prove several statistical guarantees. We then test our algorithm over real-world datasets. To that end, we first construct an offline algorithm for learning the probabilistic information spreading model, and then apply our optimal detection algorithm. Experimental study show that our algorithm outperforms state-of-The-Art misinformation detection algorithms in terms of accuracy and detection time.
AB - Modern social media platforms play an important role in facilitating rapid dissemination of information through their massive user networks. Fake news, misinformation, and unverifiable facts on social media platforms propagate disharmony and affect society. In this paper, we consider the problem of online auditing of information flow/propagation with the goal of classifying news items as fake or genuine. Specifically, driven by experiential studies on real-world social media platforms, we propose a probabilistic Markovian information spread model over networks modeled by graphs. We then formulate our inference task as a certain sequential detection problem with the goal of minimizing the combination of the error probability and the time it takes to achieve the correct decision. For this model, we find the optimal detection algorithm minimizing the aforementioned risk and prove several statistical guarantees. We then test our algorithm over real-world datasets. To that end, we first construct an offline algorithm for learning the probabilistic information spreading model, and then apply our optimal detection algorithm. Experimental study show that our algorithm outperforms state-of-The-Art misinformation detection algorithms in terms of accuracy and detection time.
KW - Misinformation flow
KW - algorithms
KW - bounds
KW - online auditing
KW - processing over graphs
KW - sequential detection
UR - http://www.scopus.com/inward/record.url?scp=85192781704&partnerID=8YFLogxK
U2 - 10.1109/TSIPN.2024.3399558
DO - 10.1109/TSIPN.2024.3399558
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85192781704
SN - 2373-776X
VL - 10
SP - 487
EP - 499
JO - IEEE Transactions on Signal and Information Processing over Networks
JF - IEEE Transactions on Signal and Information Processing over Networks
ER -