Popularity Prediction for Social Media over Arbitrary Time Horizons
Authors: Daniel Haimovich, Dima Karamshuk, Thomas J. Leeper, Evgeniy Riabenko, Milan Vojnovic
AI-generated Key Points
- The paper addresses the challenge of predicting the popularity of social media content in real-time.
- Accurate prediction of content popularity is crucial for various applications, including detecting and moderating harmful viral content.
- The prediction task is complex due to interactions between user interests, content features, resharing, feed ranking, and network structure.
- The proposed approach involves a feature-based approach based on a self-excited Hawkes point process model.
- The approach considers static features of both the content and users as well as observed popularity growth up to the prediction time.
- By combining predictions of popularity at reference horizons and an effective growth parameter, the method offers scalability and achieves high accuracy compared to leading baselines.
- Experiments conducted on a dataset consisting of public page content on Facebook over a two-month period demonstrate that the model outperforms separately trained models for specific prediction time horizons.
- Overall, the paper presents a highly scalable method for predicting social media content popularity over arbitrary time horizons that considers various factors influencing popularity and achieves competitive prediction accuracy.
Abstract: Predicting the popularity of social media content in real time requires approaches that efficiently operate at global scale. Popularity prediction is important for many applications, including detection of harmful viral content to enable timely content moderation. The prediction task is difficult because views result from interactions between user interests, content features, resharing, feed ranking, and network structure. We consider the problem of accurately predicting popularity both at any given prediction time since a content item's creation and for arbitrary time horizons into the future. In order to achieve high accuracy for different prediction time horizons, it is essential for models to use static features (of content and user) as well as observed popularity growth up to prediction time. We propose a feature-based approach based on a self-excited Hawkes point process model, which involves prediction of the content's popularity at one or more reference horizons in tandem with a point predictor of an effective growth parameter that reflects the timescale of popularity growth. This results in a highly scalable method for popularity prediction over arbitrary prediction time horizons that also achieves a high degree of accuracy, compared to several leading baselines, on a dataset of public page content on Facebook over a two-month period, covering billions of content views and hundreds of thousands of distinct content items. The model has shown competitive prediction accuracy against a strong baseline that consists of separately trained models for specific prediction time horizons.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.