Reading groups domain is a new domain for group recommenders. In this paper we propose a web based group recommender system which is called BoRGo: Book Recommender for Reading Groups, for reading groups domain. BoRGo uses a new information filtering technique which uses the difference between positive and negative feedbacks about a feature of a user profile and also presents an interface for after recommendation processes like achieving a consensus on the reading list.
Group recommender systems introduce a whole set of new challenges for recommender systems research. The notion of generating a set of recommendations that will satisfy a group of users with potentially competing interests is challenging in itself. In addition to this we must consider how to record and combine the preferences of many different users as they engage in simultaneous recommendation dialogs. In this paper we introduce a group recommender system, called CATS, that is designed to provide assistance to a group of friends trying the plan a skiing vacation. The system uses the DiamondTouch interactive tabletop to allow up to 4 users to simultaneously engage in parallel recommendation sessions and we describe how personal and shared profiles and interaction spaces can be managed to generate sets of recommendations for the individual and the group.
Recommender systems are used in variety of domains affecting people's lives. This has raised concerns about possible biases and discrimination that such systems might exacerbate. There are two primary kinds of biases inherent in recommender systems: observation bias and bias stemming from imbalanced data. Observation bias exists due to a feedback loop which causes the model to learn to only predict recommendations similar to previous ones. Imbalance in data occurs when systematic societal, historical, or other ambient bias is present in the data. In this paper, we address both biases by proposing a hybrid fairness-aware recommender system. Our model provides efficient and accurate recommendations by incorporating multiple user-user and item-item similarity measures, content, and demographic information, while addressing recommendation biases. We implement our model using a powerful and expressive probabilistic programming language called probabilistic soft logic. We experimentally evaluate our approach on a popular movie recommendation dataset, showing that our proposed model can provide more accurate and fairer recommendations, compared to a state-of-the art fair recommender system.
Quijano, Lara (Complutense University of Madrid) | Bridge, Derek (University College Cork) | Díaz-Agudo, Belén (Universidad Complutense de Madrid) | Recio-García, Juan Antonio (Universidad Complutense de Madrid)
In this paper we offer a potential solution to the cold-start problem in group recommender systems. To do so, we use information about previous group recommendation events and copy ratings from a user who played a similar role in some previous group event. We show that copying in this way, i.e. conditioned on groups, is superior to copying nothing and also superior to copying ratings from the most similar user known to the system.
Azaria, Amos (Bar Ilan University) | Hassidim, Avinatan (Bar Ilan University) | Kraus, Sarit (Bar Ilan University) | Eshkol, Adi (Viaccess-Orca) | Weintraub, Ofer (Viaccess-Orca) | Netanely, Irit (Viaccess-Orca)
Traditional recommender systems try to provide users with recommendations which maximize the probability that the user will accept them. Recent studies have shown that recommender systems have a positive effect on the provider’s revenue. In this paper we show that by giving a different set of recommendations, the recommendation system can further increase the business’ utility (e.g. revenue), without any significant drop in user satisfaction. Indeed, the recommendation system designer should have in mind both the user, whose taste we need to reveal, and the business, which wants to promote specific content. In order to study these questions, we performed a large body of experiments on Amazon Mechanical Turk. In each of the experiments, we compare a commercial state-of-the-art recommendation engine with a modified recommendation list, which takes into account the utility (or revenue) which the business obtains from each suggestion that is accepted by the user. We show that the modified recommendation list is more desirable for the business, as the end result gives the business a higher utility (or revenue). To study possible longterm effects of giving the user worse suggestions, we asked the users how they perceive the list of recommendation that they received. Our findings are that any difference in user satisfaction between the list is negligible, and not statistically significant. We also uncover a phenomenon where movie consumers prefer watching and even paying for movies that they have already seen in the past than movies that are new to them.