Max-Emanuel Keller
Research Subjects
Max-Emanuel Keller has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Döschl
HM Hochschule München University of Applied Sciences
4 shared publications - Peter Mandl
Hochschule München
4 shared publications - Alexander Schill
Technische Universität Dresden
2 shared publications Alexander Döschl
HM Hochschule München University of Applied Sciences
1 shared publication- Alexander Kaul
BIVAL GmbH
1 shared publication Alexander Schill
TU Dresden
1 shared publication
Latest Publications
- Open Access
- 11 June 2025
- Published by Springer Nature
- p. 421
Intelligent Algorithm Selection for Efficient Update Predictions in Social Media Feeds
- 11 June 2025
- Published by Springer Nature
- p. 421
Open AccessIntelligent Algorithm Selection for Efficient Update Predictions in Social Media Feeds
- 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.
- 22 November 2023
- Published by Springer Nature
- p. 493-509
A Machine Learning Approach to Enterprise Matchmaking Using Multilabel Text Classification Based on Semi-structured Website Content
- 22 November 2023
- Published by Springer Nature
- p. 493-509
A Machine Learning Approach to Enterprise Matchmaking Using Multilabel Text Classification Based on Semi-structured Website Content
- Open Access
- 6 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 340-344
Towards an adaptive algorithms selection on predicting the update interval for social media feeds
Efficiently synchronizing data with external sources, such as social media feeds, while minimizing well-timed requests is a challenge in various domains. This research investigates prediction algorithms for determining appropriate update intervals for Facebook and Twitter feeds, considering metrics such as the delay (time between a post's publication and retrieval) and requests per post. Due to variations in update intervals, different algorithms yield diverse results. Selecting the most suitable algorithm for each feed is a time-consuming but crucial task for achieving optimal resource usage. We propose three strategies for algorithm selection: baseline (using a single algorithm per feed), optimum (calculating the best algorithm for each feed), and classification (identifying algorithms through classification). Real-world data from Facebook and Twitter are used to evaluate the strategies, comprehensively assessing their strengths and weaknesses. Findings demonstrate that the strategy optimum identifies the best algorithms, while the strategy classification selects fairly good algorithms at significantly reduced computational effort.
- 6 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 340-344
Open AccessTowards an adaptive algorithms selection on predicting the update interval for social media feeds
Efficiently synchronizing data with external sources, such as social media feeds, while minimizing well-timed requests is a challenge in various domains. This research investigates prediction algorithms for determining appropriate update intervals for Facebook and Twitter feeds, considering metrics such as the delay (time between a post's publication and retrieval) and requests per post. Due to variations in update intervals, different algorithms yield diverse results. Selecting the most suitable algorithm for each feed is a time-consuming but crucial task for achieving optimal resource usage. We propose three strategies for algorithm selection: baseline (using a single algorithm per feed), optimum (calculating the best algorithm for each feed), and classification (identifying algorithms through classification). Real-world data from Facebook and Twitter are used to evaluate the strategies, comprehensively assessing their strengths and weaknesses. Findings demonstrate that the strategy optimum identifies the best algorithms, while the strategy classification selects fairly good algorithms at significantly reduced computational effort.