Limits to Surprise in Recommender Systems

07/10/2018
by   Andre Paulino de Lima, et al.
0

In this study, we address the challenge of measuring the ability of a recommender system to make surprising recommendations. Although current evaluation methods make it possible to determine if two algorithms can make recommendations with a significant difference in their average surprise measure, it could be of interest to our community to know how competent an algorithm is at embedding surprise in its recommendations, without having to resort to making a direct comparison with another algorithm. We argue that a) surprise is a finite resource in a recommender system, b) there is a limit to how much surprise any algorithm can embed in a recommendation, and c) this limit can provide us with a scale against which the performance of any algorithm can be measured. By exploring these ideas, it is possible to define the concepts of maximum and minimum potential surprise and design a surprise metric called "normalised surprise" that employs these limits to potential surprise. Two experiments were conducted to test the proposed metric. The aim of the first was to validate the quality of the estimates of minimum and maximum potential surprise produced by a greedy algorithm. The purpose of the second experiment was to analyse the behaviour of the proposed metric using the MovieLens dataset. The results confirmed the behaviour that was expected, and showed that the proposed surprise metric is both effective and consistent for differing choices of recommendation algorithms, data representations and distance functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2018

One-at-a-time: A Meta-Learning Recommender-System for Recommendation-Algorithm Selection on Micro Level

In this proposal we present the idea of a "macro recommender system", an...
research
08/25/2009

Maximizing profit using recommender systems

Traditional recommendation systems make recommendations based solely on ...
research
06/21/2021

Data Optimisation for a Deep Learning Recommender System

This paper advocates privacy preserving requirements on collection of us...
research
12/13/2018

Comparison of Recommender Systems in an Ed-Tech Application

Smile and Learn is an Ed-Tech company that runs a smart library with mor...
research
10/27/2017

Combining Aspects of Genetic Algorithms with Weighted Recommender Hybridization

Recommender systems are established means to inspire users to watch inte...
research
11/25/2022

The Economics of Recommender Systems: Evidence from a Field Experiment on MovieLens

We conduct a field experiment on a movie-recommendation platform to iden...

Please sign up or login with your details

Forgot password? Click here to reset