Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Michal Kompan

dblp:35/8468 · DBLP profile ↗
← Back
10ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0002-4649-5120ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 since 2021Databases, data management, data science and information retrieval · 4 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 67% Optimization for machine learning · 33%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Network and information security
1 paper
Web and mobile security · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › off-policy evaluation
estimator selection
0.912025
Cross-Validated Off-Policy Evaluation · AAAI 2025
Machine learning › Optimization for machine learning
hyperparameter optimization
0.912025
Cross-Validated Off-Policy Evaluation · AAAI 2025
Machine learning › Reinforcement learning
off-policy evaluation
0.912025
Cross-Validated Off-Policy Evaluation · AAAI 2025
Recommender systems
video recommendation
0.612022
Black-box Audit of YouTube's Video Recommendation: Investigation of Misinformation Filter Bubble Dynamics (Extended Abstract) · IJCAI 2022
Recommender systems › fairness and bias
filter bubble
0.212022
Black-box Audit of YouTube's Video Recommendation: Investigation of Misinformation Filter Bubble Dynamics (Extended Abstract) · IJCAI 2022
Web and mobile security
misinformation
0.212022
Black-box Audit of YouTube's Video Recommendation: Investigation of Misinformation Filter Bubble Dynamics (Extended Abstract) · IJCAI 2022

Methods — techniques the papers use, named apart from their topics

sockpuppeting · 1.1black-box audit · 1.1cross-validation · 0.9
YearPublicationVenuePosition
2025 Cross-Validated Off-Policy Evaluation
abstract
We study estimator selection and hyper-parameter tuning in off-policy evaluation. Although cross-validation is the most popular method for model selection in supervised learning, off-policy evaluation relies mostly on theory, which provides only limited guidance to practitioners. We show how to use cross-validation for off-policy evaluation. This challenges a popular belief that cross-validation in off-policy evaluation is not feasible. We evaluate our method empirically and show that it addresses a variety of use cases.
Matej Cief, Branislav Kveton, Michal Kompan
AAAI3
2024 Pessimistic Off-Policy Optimization for Learning to Rank
abstract
Off-policy learning is a framework for optimizing policies without deploying them, using data collected by another policy. In recommender systems, this is especially challenging due to the imbalance in logged data: some items are recommended and thus logged more frequently than others. This is further perpetuated when recommending a list of items, as the action space is combinatorial. To address this challenge, we study pessimistic off-policy optimization for learning to rank. The key idea is to compute lower confidence bounds on parameters of click models and then return the list with the highest pessimistic estimate of its value. This approach is computationally efficient, and we analyze it. We study its Bayesian and frequentist variants and overcome the limitation of unknown prior by incorporating empirical Bayes. To show the empirical effectiveness of our approach, we compare it to off-policy optimizers that use inverse propensity scores or neglect uncertainty. Our approach outperforms all baselines and is both robust and general.
Matej Cief, Branislav Kveton, Michal Kompan
ECAI3
2023 Auditing YouTube's Recommendation Algorithm for Misinformation Filter Bubbles
abstract
In this article, we present results of an auditing study performed over YouTube aimed at investigating how fast a user can get into a misinformation filter bubble, but also what it takes to “burst the bubble,” i.e., revert the bubble enclosure. We employ a sock puppet audit methodology, in which pre-programmed agents (acting as YouTube users) delve into misinformation filter bubbles by watching misinformation-promoting content. Then they try to burst the bubbles and reach more balanced recommendations by watching misinformation-debunking content. We record search results, home page results, and recommendations for the watched videos. Overall, we recorded 17,405 unique videos, out of which we manually annotated 2,914 for the presence of misinformation. The labeled data was used to train a machine learning model classifying videos into three classes (promoting, debunking, neutral) with the accuracy of 0.82. We use the trained model to classify the remaining videos that would not be feasible to annotate manually. Using both the manually and automatically annotated data, we observe the misinformation bubble dynamics for a range of audited topics. Our key finding is that even though filter bubbles do not appear in some situations, when they do, it is possible to burst them by watching misinformation-debunking content (albeit it manifests differently from topic to topic). We also observe a sudden decrease of misinformation filter bubble effect when misinformation-debunking videos are watched after misinformation-promoting videos, suggesting a strong contextuality of recommendations. Finally, when comparing our results with a previous similar study, we do not observe significant improvements in the overall quantity of recommended misinformation content.
Ivan Srba, Róbert Móro, Matús Tomlein, Branislav Pecher, Jakub Simko, Elena Stefancova, Michal Kompan, Andrea Hrckova, Juraj Podrouzek, Adrian Gavornik, Mária Bieliková
Trans. Recomm. Syst.7
2023 Considering temporal aspects in recommender systems: a survey
Veronika Bogina, Tsvi Kuflik, Dietmar Jannach, Mária Bieliková, Michal Kompan, Christoph Trattner
User Model. User Adapt. Interact.5
2022 Black-box Audit of YouTube's Video Recommendation: Investigation of Misinformation Filter Bubble Dynamics (Extended Abstract)
abstract
In this paper, we describe a black-box sockpuppeting audit which we carried out to investigate the creation and bursting dynamics of misinformation filter bubbles on YouTube. Pre-programmed agents acting as YouTube users stimulated YouTube's recommender systems: they first watched a series of misinformation promoting videos (bubble creation) and then a series of misinformation debunking videos (bubble bursting). Meanwhile, agents logged videos recommended to them by YouTube. After manually annotating these recommendations, we were able to quantify the portion of misinformative videos among them. The results confirm the creation of filter bubbles (albeit not in all situations) and show that these bubbles can be bursted by watching credible content. Drawing a direct comparison with a previous study, we do not see improvements in overall quantities of misinformation recommended.
Matús Tomlein, Branislav Pecher, Jakub Simko, Ivan Srba, Róbert Móro, Elena Stefancova, Michal Kompan, Andrea Hrckova, Juraj Podrouzek, Mária Bieliková
IJCAI7
2021 An Audit of Misinformation Filter Bubbles on YouTube: Bubble Bursting and Recent Behavior Changes
abstract
The negative effects of misinformation filter bubbles in adaptive systems have been known to researchers for some time. Several studies investigated, most prominently on YouTube, how fast a user can get into a misinformation filter bubble simply by selecting “wrong choices” from the items offered. Yet, no studies so far have investigated what it takes to “burst the bubble”, i.e., revert the bubble enclosure. We present a study in which pre-programmed agents (acting as YouTube users) delve into misinformation filter bubbles by watching misinformation promoting content (for various topics). Then, by watching misinformation debunking content, the agents try to burst the bubbles and reach more balanced recommendation mixes. We recorded the search results and recommendations, which the agents encountered, and analyzed them for the presence of misinformation. Our key finding is that bursting of a filter bubble is possible, albeit it manifests differently from topic to topic. Moreover, we observe that filter bubbles do not truly appear in some situations. We also draw a direct comparison with a previous study. Sadly, we did not find much improvements in misinformation occurrences, despite recent pledges by YouTube.
Matús Tomlein, Branislav Pecher, Jakub Simko, Ivan Srba, Róbert Móro, Elena Stefancova, Michal Kompan, Andrea Hrckova, Juraj Podrouzek, Mária Bieliková
RecSys7
2019 Improving the Personalized Recommendation in the Cold-start Scenarios
abstract
Recommender systems generate items that should be interesting for the customers. However, recommenders usually fail in the cold-start scenario - when a new item or a new customer appears. In our work, we study the cold-start problem for a new customer. For a cold-start customer we find the most similar customers and use a “their” pre-trained collaborative filtering model to recommend. We compare several recommendation approaches and similarity metrics to analyze the accuracy and computational performance.
Péter Gáspár, Michal Kompan, Matej Koncal, Mária Bieliková
DSAA2
2018 Acquisition and Modelling of Short-TermUser Behaviour on theWeb: A Survey
abstract
User behaviour in data intensive applications such as the Web-based applications represents a complex set of actions influenced by plenty of factors.Thanks to this complexity, it is extremely hard for human to be able to understand all its aspects.Despite of this, by observing user actions from multiple views, we are able to extract and to model typical behaviour and its deviations on the Web.The website itself, together with transaction server logs, includes information about the site structure, content and about the actual user actions (clicks) within the site.User actions logically reflect the behaviour, while other sources indicate his/her context.Combination of these data sources allows to model the typical user behaviour and his/her preferences.The longterm behaviour describes relatively stable user preferences based on extensive user history.As the Web has become more and more dynamic, modelling user behaviour from the long-term perspective does not satisfy requirements of current Web based applications.On the other side, the short-term behaviour describes current user activity and his/her actual intent.However, this source of information is often noisy.To address these shortcomings the state-ofthe-art combines both perspectives, which allows to meaningful and timely modelling of user behaviour.In this paper, we provide a comprehensive survey
Ondrej Kassák, Michal Kompan, Mária Bieliková
J. Web Eng.2
2016 Student behavior in a web-based educational system: Exit intent prediction
Ondrej Kassák, Michal Kompan, Mária Bieliková
Eng. Appl. Artif. Intell.2
2016 Personalized hybrid recommendation for group of users: Top-N multimedia recommender
Ondrej Kassák, Michal Kompan, Mária Bieliková
Inf. Process. Manag.2