Peter Mandl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Peter Mandl has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
Andreas Bakomenko
11 shared publicationsJohannes Weiß
11 shared publicationsAlexander Schill
Tech. Univ. Dresden, Dresden, Germany
7 shared publications- Manuel Weber
Munich University of Applied Sciences (HM)
5 shared publications - Alexander Döschl
HM Hochschule München University of Applied Sciences
4 shared publications Johannes Weiss
Tech. Univ. Dresden, Dresden, Germany
4 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 118236-118247
Leveraging Conversational Context for German Hate Speech Detection With Large Language Models
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 118236-118247
Open AccessLeveraging Conversational Context for German Hate Speech Detection With Large Language Models
- 5 December 2024
- Published by Springer Nature
- p. 1-6
Einführung
- 5 December 2024
- Published by Springer Nature
- p. 99-100
Zusammenfassung
- 5 December 2024
- Published by Springer Nature
- p. 81-97
Bash-Programmierung
- 5 December 2024
- Published by Springer Nature
- p. 7-32
Konzepte und erste Kommandos
- 5 December 2024
- Published by Springer Nature
- p. 67-80
Prozesse
- 5 December 2024
- Published by Springer Nature
- p. 33-52
Kommandos für die Dateibearbeitung
- 5 December 2024
- Published by Springer Nature
- p. 53-66
Berechtigungskonzept
- 4 December 2024
- Published by Springer Nature
- p. 212-226
HOCON34k: A Corpus of Hate Speech in Online Comments from German Newspapers
- 4 December 2024
- Published by Springer Nature
- p. 212-226
HOCON34k: A Corpus of Hate Speech in Online Comments from German Newspapers
- Open Access
- 20 August 2024
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 14 (1) , 1-19
Intelligent algorithm selection for efficient update predictions in social media feeds
Efficiently synchronizing data with social media feeds while minimizing unnecessary requests presents a significant challenge in various fields. This paper investigates prediction algorithms for determining the optimal update intervals for Facebook and Twitter (now X) feeds, focusing on metrics such as delay (the time between a post’s publication and its retrieval) and requests per post. Variations in update intervals result in different algorithms producing varying results, making the selection of the most suitable algorithm for each feed crucial yet time-intensive. To address this, we propose three strategies for algorithm selection: baseline (applying a single algorithm to all feeds), optimum (identifying the best algorithm for each individual feed), and classification (selecting algorithms through a classification process based on each feed’s unique update patterns and context). Our strategies leverage various prediction algorithms, including static and adaptive algorithms, and inhomogeneous Poisson processes. We evaluate these strategies using real-world data from Facebook and Twitter, thoroughly assessing their performance in terms of delay and request efficiency. The findings demonstrate that the strategy Optimum effectively identifies the best algorithms for each feed, ensuring the highest prediction quality, though at a considerable computational cost. On the other hand, the strategy Classification offers superior runtime performance required to select algorithms. This research highlights the trade-offs between delay and request efficiency and presents a comprehensive solution for optimizing update predictions in social media feeds.
- 20 August 2024
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 14 (1) , 1-19
Open AccessIntelligent algorithm selection for efficient update predictions in social media feeds
Efficiently synchronizing data with social media feeds while minimizing unnecessary requests presents a significant challenge in various fields. This paper investigates prediction algorithms for determining the optimal update intervals for Facebook and Twitter (now X) feeds, focusing on metrics such as delay (the time between a post’s publication and its retrieval) and requests per post. Variations in update intervals result in different algorithms producing varying results, making the selection of the most suitable algorithm for each feed crucial yet time-intensive. To address this, we propose three strategies for algorithm selection: baseline (applying a single algorithm to all feeds), optimum (identifying the best algorithm for each individual feed), and classification (selecting algorithms through a classification process based on each feed’s unique update patterns and context). Our strategies leverage various prediction algorithms, including static and adaptive algorithms, and inhomogeneous Poisson processes. We evaluate these strategies using real-world data from Facebook and Twitter, thoroughly assessing their performance in terms of delay and request efficiency. The findings demonstrate that the strategy Optimum effectively identifies the best algorithms for each feed, ensuring the highest prediction quality, though at a considerable computational cost. On the other hand, the strategy Classification offers superior runtime performance required to select algorithms. This research highlights the trade-offs between delay and request efficiency and presents a comprehensive solution for optimizing update predictions in social media feeds.