Detecting rumours with latency guarantees using massive streaming data

TT Nguyen, TT Huynh, H Yin, M Weidlich, TT Nguyen… - The VLDB Journal, 2023 - Springer
Today's social networks continuously generate massive streams of data, which provide a
valuable starting point for the detection of rumours as soon as they start to propagate.
However, rumour detection faces tight latency bounds, which cannot be met by
contemporary algorithms, given the sheer volume of high-velocity streaming data emitted by
social networks. Hence, in this paper, we argue for best-effort rumour detection that detects
most rumours quickly rather than all rumours with a high delay. To this end, we combine …

Detecting Rumours with Latency Guarantees using Massive Streaming Data

T Tam Nguyen, TT Huynh, H Yin, M Weidlich… - arXiv e …, 2022 - ui.adsabs.harvard.edu
Today's social networks continuously generate massive streams of data, which provide a
valuable starting point for the detection of rumours as soon as they start to propagate.
However, rumour detection faces tight latency bounds, which cannot be met by
contemporary algorithms, given the sheer volume of high-velocity streaming data emitted by
social networks. Hence, in this paper, we argue for best-effort rumour detection that detects
most rumours quickly rather than all rumours with a high delay. To this end, we combine …
Showing the best results for this search. See all results