Recommending Serendipitous Items using Transfer Learning
Pandey, G., Kotkov, D., & Semenov, A. (2018). Recommending Serendipitous Items using Transfer Learning. In CIKM '18 : Proceedings of the 27th ACM International Conference on Information and Knowledge Management (pp. 1771-1774). ACM Press. https://doi.org/10.1145/3269206.3269268
Date
2018Copyright
© 2018 ACM
Most recommender algorithms are designed to suggest relevant items, but suggesting these items does not always result in user satisfaction. Therefore, the efforts in recommender systems recently shifted towards serendipity, but generating serendipitous recommendations is difficult due to the lack of training data. To the best of our knowledge, there are many large datasets containing relevance scores (relevance oriented) and only one publicly available dataset containing a relatively small number of serendipity scores (serendipity oriented). This limits the learning capabilities of serendipity oriented algorithms. Therefore, in the absence of any known deep learning algorithms for recommending serendipitous items and the lack of large serendipity oriented datasets, we introduce SerRec our novel transfer learning method to recommend serendipitous items. SerRec uses transfer learning to firstly train a deep neural network for relevance scores using a large dataset and then tunes it for serendipity scores using a smaller dataset. Our method shows benefits of transfer learning for recommending serendipitous items as well as performance gains over the state-of-the-art serendipity oriented algorithms
...
Publisher
ACM PressParent publication ISBN
978-1-4503-6014-2Conference
ACM International Conference on Information and Knowledge ManagementIs part of publication
CIKM '18 : Proceedings of the 27th ACM International Conference on Information and Knowledge ManagementISSN Search the Publication Forum
2155-0751Keywords
Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/28680636
Metadata
Show full item recordCollections
License
Related items
Showing items with similar title or keywords.
-
Serendipity in recommender systems
Kotkov, Denis (University of Jyväskylä, 2018)The number of goods and services (such as accommodation or music streaming) offered by e-commerce websites does not allow users to examine all the available options in a reasonable amount of time. Recommender systems are ... -
How does serendipity affect diversity in recommender systems? A serendipity-oriented greedy algorithm
Kotkov, Denis; Veijalainen, Jari; Wang, Shuaiqiang (Springer Wien, 2020)Most recommender systems suggest items that are popular among all users and similar to items a user usually consumes. As a result, the user receives recommendations that she/he is already familiar with or would find anyway, ... -
A Serendipity-Oriented Greedy Algorithm for Recommendations
Kotkov, Denis; Veijalainen, Jari; Wang, Shuaiqiang (SCITEPRESS Science And Technology Publications, 2017)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 ... -
Challenges of Serendipity in Recommender Systems
Kotkov, Denis; Veijalainen, Jari; Wang, Shuaiqiang (SCITEPRESS, 2016)Most recommender systems suggest items similar to a user profile, which results in boring recommendations limited by user preferences indicated in the system. To overcome this problem, recommender systems should suggest ... -
Improving Serendipity and Accuracy in Cross-Domain Recommender Systems
Kotkov, Denis; Wang, Shuaiqiang; Veijalainen, Jari (Springer International Publishing AG, 2017)Cross-domain recommender systems use information from source domains to improve recommendations in a target domain, where the term domain refers to a set of items that share attributes and/or user ratings. Most works ...