Markov chain Monte Carlo for effective personalized recommendationsMarkov chain Monte Carlo for effective personalized recommendations Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2020-10-262018enThis paper adopts a Bayesian approach for finding top recommendations. The approach is entirely personalized, and consists of learning a utility function over user preferences via employing a sampling-based, non-intrusive preference elicitation framework. We explicitly model the uncertainty over the utility function and learn it through passive user feedback, provided in the form of clicks on previously recommended items. The utility function is a linear combination of weighted features, and beliefs are maintained using a Markov Chain Monte Carlo algorithm. Our approach overcomes the problem of having conflicting user constraints by identifying a convex region within a user’s preferences model. Additionally, it handles situations where not enough data about the user is available, by exploiting the information from clusters of (feature) weight vectors created by observing other users’ behavior. We evaluate our system’s performance by applying it in the online hotel booking recommendations domain using a real-world dataset, with very encouraging results.http://creativecommons.org/licenses/by/4.0/188-20416th European Conference on Multi-Agent SystemsMulti-Agent Systems Papilaris Michail-Aggelos Παπιλαρης Μιχαηλ-Αγγελος Chalkiadakis Georgios Χαλκιαδακης Γεωργιος Springer Nature Adaptation and learning Recommender systems Bayesian networks