A Serendipity-Oriented Greedy Algorithm for Recommendations

Denis Kotkov, Jari Veijalainen, Shuaiqiang Wang
2017 Proceedings of the 13th International Conference on Web Information Systems and Technologies  
Most recommender systems suggest items to a user that are popular among all users and similar to items the user usually consumes. As a result, a user receives recommendations that she/he is already familiar with or would find anyway, leading to low satisfaction. To overcome this problem, a recommender system should suggest novel, relevant and unexpected, i.e. serendipitous items. In this paper, we propose a serendipity-oriented algorithm, which improves serendipity through feature
more » ... n and helps overcome the overspecialization problem. To evaluate our algorithm and compare it with others, we employ a serendipity metric that captures each component of serendipity, unlike the most common metric.
doi:10.5220/0006232800320040 dblp:conf/webist/KotkovVW17 fatcat:j2mau6f2ivcpjnnffavjd5jr5u