paper-with-me

Papers

QuickStop: A Markov Optimal Stopping Approach for Quickest Misinformation Detection

2019-03-04 · Honghao Wei, Xiaohan Kang, Weina Wang, Lei Ying

This paper combines data-driven and model-driven methods for real-time misinformation detection. Our algorithm, named QuickStop, is an optimal stopping algorithm based on a probabilistic information spreading model obtained from labeled data. The algorithm consists of an offline machine learning algorithm for learning the probabilistic information spreading model and an online optimal stopping algorithm to detect misinformation. The online detection algorithm has both low computational and memory complexities. Our numerical evaluations with a real-world dataset show that QuickStop outperforms existing misinformation detection algorithms in terms of both accuracy and detection time (number of observations needed for detection). Our evaluations with synthetic data further show that QuickStop is robust to (offline) learning errors.

📄 PDF Abstract BibTeX arXiv:1903.04887

Code (0)

등록된 구현이 없습니다.

Tasks

Misinformation

Similar Papers 제목 키워드 기반

Controlling a Markov Decision Process with an Abrupt Change in the Transition Kernel

2022-10-08 · Nathan Dahlin, Subhonmesh Bose, Venugopal V. Veeravalli

We consider the control of a Markov decision process (MDP) that undergoes an abrupt change in its transition kernel (mode). We formulate the problem of minimizing regret under control-switching based on mode change detec…

Change Detection

Exactly Optimal Quickest Change Detection of Markov Chains

2023-03-24 · Jason J. Ford, Justin M. Kennedy, Caitlin Tompkins, Jasmin James 외

This paper establishes that an exactly optimal rule for Bayesian Quickest Change Detection (QCD) of Markov chains is a threshold test on the no change posterior. We also provide a computationally efficient scalar filter …

Change Detection

Exactly Optimal Bayesian Quickest Change Detection for Hidden Markov Models

2020-08-31 · Jason J. Ford, Jasmin James, Timothy L. Molloy

This paper considers the quickest detection problem for hidden Markov models (HMMs) in a Bayesian setting. We construct an augmented HMM representation of the problem that allows the application of a dynamic programming …

Change Detection

Quickest Change Detection in Autoregressive Models

2023-10-13 · Zhongchang Sun, Shaofeng Zou

The problem of quickest change detection (QCD) in autoregressive (AR) models is investigated. A system is being monitored with sequentially observed samples. At some unknown time, a disturbance signal occurs and changes …

Change Detection

Quickest change detection for multi-task problems under unknown parameters

2021-01-01 · Firas Jarboui, Vianney Perchet

We consider the quickest change detection problem where both the parameters of pre- and post- change distributions are unknown, which prevent the use of classical simple hypothesis testing. Without additional assumptions…

Change DetectionTwo-sample testing