Characterizing and Predicting Bursty Events: The Buzz Case Study on Twitter
The prediction of bursty events on the Internet is a challenging task. Difficulties are due to the diversity of information sources, the size of the Internet, dynamics of popularity, user behaviors... On the other hand, Twitter is a structured and limited space. In this paper, we present a new method for predicting bursty events using content-related indices. Prediction is performed by a neural network that combines three features in order to predict the number of retweets of a tweet on the Twitter platform. The indices are related to popularity, expressivity and singularity. Popularity index is based on the analysis of RSS streams. Expressivity uses a dictionary that contains words annotated in terms of expressivity load. Singularity represents outlying topic association estimated via a Latent Dirichlet Allocation (LDA) model. Experiments demonstrate the effectiveness of the proposal with a 72{\%} F-measure prediction score for the tweets that have been forwarded at least 60 times.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityPredictionSimilar Papers 제목 키워드 기반
bursty_dynamics: A Python Package for Exploring the Temporal Properties of Longitudinal Data
Understanding the temporal properties of longitudinal data is critical for identifying trends, predicting future events, and making informed decisions in any field where temporal data is analysed, including health and ep…
EpidemiologyTime Series AnalysisBurstiness Scale: a highly parsimonious model for characterizing random series of events
The problem to accurately and parsimoniously characterize random series of events (RSEs) present in the Web, such as e-mail conversations or Twitter hashtags, is not trivial. Reports found in the literature reveal two ap…
A Semi-automatic Method for Efficient Detection of Stories on Social Media
Twitter has become one of the main sources of news for many people. As real-world events and emergencies unfold, Twitter is abuzz with hundreds of thousands of stories about the events. Some of these stories are harmless…
A Continuous-time Mutually-Exciting Point Process Framework for Prioritizing Events in Social Media
The overwhelming amount and rate of information update in online social media is making it increasingly difficult for users to allocate their attention to their topics of interest, thus there is a strong need for priorit…
BUZZ: Beehive-structured Sparse KV Cache with Segmented Heavy Hitters for Efficient LLM Inference
Large language models (LLMs) are essential in natural language processing but often struggle with inference speed and computational efficiency, limiting real-time deployment. The key-value (KV) cache mechanism reduces co…
Computational EfficiencyQuestion AnsweringText Summarization