Andreas Lommatzsch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andreas Lommatzsch has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin Kille
Norwegian University of Science and Technology, Trondheim, Norway
2 shared publications Benjamin Kille
TU Berlin
1 shared publication- Brijnesh Jain
Department of Computer Science and Mathematics, OTH Regensburg, Regensburg, Germany
1 shared publication - Christian Geissler
Technische Universität Berlin, TEL-14, Berlin, Germany
1 shared publication - Frank Hopfgartner
University of Koblenz
1 shared publication - Jens Meiners
DAI-Labor, TU Berlin
1 shared publication
Latest Publications
- Open Access
- 14 September 2024
- Published by Springer Nature in User Modeling and User-Adapted Interaction
- Vol. 34 (4) , 921-923
Preface to the special issue on news personalization and analytics
- 14 September 2024
- Published by Springer Nature in User Modeling and User-Adapted Interaction
- Vol. 34 (4) , 921-923
Open AccessPreface to the special issue on news personalization and analytics
- Open Access
- 9 October 2020
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 16 (2) , 173-189
When algorithm selection meets Bi-linear Learning to Rank: accuracy and inference time trade off with candidates expansion
Algorithm selection (AS) tasks are dedicated to find the optimal algorithm for an unseen problem instance. With the knowledge of problem instances’ meta-features and algorithms’ landmark performances, Machine Learning (ML) approaches are applied to solve AS problems. However, the standard training process of benchmark ML approaches in AS either needs to train the models specifically for every algorithm or relies on the sparse one-hot encoding as the algorithms’ representation. To escape these intermediate steps and form the mapping function directly, we borrow the learning to rank framework from Recommender System (RS) and embed the bi-linear factorization to model the algorithms’ performances in AS. This Bi-linear Learning to Rank (BLR) has proven to work with competence in some AS scenarios and thus is also proposed as a benchmark approach. Thinking from the evaluation perspective in the modern AS challenges, precisely predicting the performance is usually the measuring goal. Though approaches’ inference time also needs to be counted for the running time cost calculation, it’s always overlooked in the evaluation process. The multi-objective evaluation metric Adjusted Ratio of Root Ratios (A3R) is therefore advocated in this paper to balance the trade-off between the accuracy and inference time in AS. Concerning A3R, BLR outperforms other benchmarks when expanding the candidates range to TOP3. The better effect of this candidates expansion results from the cumulative optimum performance during the AS process. We take the further step in the experimentation to represent the advantage of such TOPK expansion, and illustrate that such expansion can be considered as the supplement for the convention of TOP1 selection during the evaluation process.
- 9 October 2020
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 16 (2) , 173-189
Open AccessWhen algorithm selection meets Bi-linear Learning to Rank: accuracy and inference time trade off with candidates expansion
Algorithm selection (AS) tasks are dedicated to find the optimal algorithm for an unseen problem instance. With the knowledge of problem instances’ meta-features and algorithms’ landmark performances, Machine Learning (ML) approaches are applied to solve AS problems. However, the standard training process of benchmark ML approaches in AS either needs to train the models specifically for every algorithm or relies on the sparse one-hot encoding as the algorithms’ representation. To escape these intermediate steps and form the mapping function directly, we borrow the learning to rank framework from Recommender System (RS) and embed the bi-linear factorization to model the algorithms’ performances in AS. This Bi-linear Learning to Rank (BLR) has proven to work with competence in some AS scenarios and thus is also proposed as a benchmark approach. Thinking from the evaluation perspective in the modern AS challenges, precisely predicting the performance is usually the measuring goal. Though approaches’ inference time also needs to be counted for the running time cost calculation, it’s always overlooked in the evaluation process. The multi-objective evaluation metric Adjusted Ratio of Root Ratios (A3R) is therefore advocated in this paper to balance the trade-off between the accuracy and inference time in AS. Concerning A3R, BLR outperforms other benchmarks when expanding the candidates range to TOP3. The better effect of this candidates expansion results from the cumulative optimum performance during the AS process. We take the further step in the experimentation to represent the advantage of such TOPK expansion, and illustrate that such expansion can be considered as the supplement for the convention of TOP1 selection during the evaluation process.
- 6 June 2018
- Published by Springer Nature
- p. 127-141
A Next Generation Chatbot-Framework for the Public Administration
- 6 June 2018
- Published by Springer Nature
- p. 127-141
A Next Generation Chatbot-Framework for the Public Administration
- 17 August 2017
- Published by Springer Nature
- p. 239-254
CLEF 2017 NewsREEL Overview: A Stream-Based Recommender Task for Evaluation and Education
- 17 August 2017
- Published by Springer Nature
- p. 239-254
CLEF 2017 NewsREEL Overview: A Stream-Based Recommender Task for Evaluation and Education
- 13 November 2016
- Published by Springer Nature
- p. 173-191
Topic Tracking in News Streams Using Latent Factor Models
- 13 November 2016
- Published by Springer Nature
- p. 173-191
Topic Tracking in News Streams Using Latent Factor Models
- 15 January 2015
- Published by Springer Nature
- p. 181-211
Personalized Information Access Using Semantic Knowledge
- 15 January 2015
- Published by Springer Nature
- p. 181-211
Personalized Information Access Using Semantic Knowledge
- 15 January 2015
- Published by Springer Nature
- p. 125-147
Semantic Movie Recommendations