Just Accepted
A Deep Learning Model for Cross-Domain Serendipity Recommendations
Authors: 
Zhe Fu, Xi Niu, Xiangcheng Wu, Ruhani RahmanAuthors Info & Claims
Zhe Fu, Xi Niu, Xiangcheng Wu, Ruhani RahmanAuthors Info & ClaimsAbstract
Serendipity means unexpected discoveries that are valuable, with positive outcomes ranging from personal benefits to scientific breakthroughs. This study proposes a cross-domain recommendation model, called SerenCDR, to model serendipity. SerenCDR leverages the knowledge beyond one domain as well as mitigates the inherent data sparsity problem in serendipity recommendations. The novelty of SerenCDR lies in the fact that it is the first deep learning-based cross-domain model for a serendipity task. More importantly, it does not rely on any overlapping users or overlapping items across different domains, which especially fits for the task of recommending serendipity, because serendipity in a single domain tends to be sparse; finding overlapping users or overlapping items in other domains are nearly impossible. To train and test SerenCDR, we have collected a two-domain ground truth dataset on serendipity, called SerenCDRLens. In addition, since we found that serendipity is sparse in SerenCDRLens, we designed an auxiliary loss function to supplement the main loss function to enhance serendipity learning. Through a series of experiments, we have harvested positive performance in recommending serendipity, empowering users with increased chances of bumping into unexpected but valuable discoveries.
References
[1]
Fakhri Abbas and Xi Niu. 2019. Computational serendipitous recommender system frameworks: A literature survey. In 2019 IEEE/ACS 16th International Conference on Computer Systems and Applications (AICCSA). IEEE, 1–8.
[2]
Fakhri Abbas and Xi Niu. 2019. One size does not fit all: Modeling users’ personal curiosity in recommender systems. ArXivorg (2019).
[3]
Iván Cantador, Ignacio Fernández-Tobías, Shlomo Berkovsky, and Paolo Cremonesi. 2015. Cross-domain recommender systems. Recommender systems handbook(2015), 919–959.
[4]
Jaime Carbonell and Jade Goldstein. 1998. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval. 335–336.
[5]
Xu Chen, Ya Zhang, Ivor W Tsang, Yuangang Pan, and Jingchao Su. 2023. Toward Equivalent Transformation of User Preferences in Cross Domain Recommendation. ACM Transactions on Information Systems 41, 1 (2023), 1–31.
[6]
Andrzej Cichocki and Anh-Huy Phan. 2009. Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE transactions on fundamentals of electronics, communications and computer sciences 92, 3 (2009), 708–721.
[7]
Paolo Cremonesi, Antonio Tripodi, and Roberto Turrin. 2011. Cross-domain recommender systems. In 2011 IEEE 11th International Conference on Data Mining Workshops. Ieee, 496–503.
[8]
Xiangyu Fan and Xi Niu. 2018. Implementing and evaluating serendipity in delivering personalized health information. ACM Transactions on Management Information Systems (TMIS) 9, 2(2018), 1–19.
[9]
Zhe Fu and Xi Niu. 2023. Modeling Users’ Curiosity in Recommender Systems. ACM Transactions on Knowledge Discovery from Data 18, 1 (2023), 1–23.
[10]
Zhe Fu and Xi Niu. 2024. The Art of Asking: Prompting Large Language Models for Serendipity Recommendations. In Proceedings of the 2024 ACM SIGIR International Conference on Theory of Information Retrieval. 157–166.
[11]
Zhe Fu, Xi Niu, and Mary Lou Maher. 2023. Deep learning models for serendipity recommendations: a survey and new perspectives. Comput. Surveys 56, 1 (2023), 1–26.
[12]
Zhe Fu, Xi Niu, and Li Yu. 2023. Wisdom of Crowds and Fine-Grained Learning for Serendipity Recommendations. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 739–748.
[13]
Chen Gao, Xiangning Chen, Fuli Feng, Kai Zhao, Xiangnan He, Yong Li, and Depeng Jin. 2019. Cross-domain recommendation without sharing user-relevant data. In The world wide web conference. 491–502.
[14]
Kazjon Grace, M Maher, Douglas Fisher, and Katherine Brady. 2014. A data-intensive approach to predicting creative designs based on novelty, value and surprise. International Journal of Design, Creativity, and Innovation (2014).
[15]
Ted Gup. 1998. Technology and the End of Serendipity. The Education Digest 63, 7 (1998), 48.
[16]
Zhongxuan Han, Xiaolin Zheng, Chaochao Chen, Wenjie Cheng, and Yang Yao. 2023. Intra and Inter Domain HyperGraph Convolutional Network for Cross-Domain Recommendation. In Proceedings of the ACM Web Conference 2023. 449–459.
[17]
F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4(2015), 1–19.
[18]
Ming He, Jiuling Zhang, Peng Yang, and Kaisheng Yao. 2018. Robust transfer learning for cross-domain collaborative filtering using multiple rating patterns approximation. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. 225–233.
[19]
Ming He, Jiuling Zhang, and Shaozong Zhang. 2019. ACTL: Adaptive codebook transfer learning for cross-domain recommendation. IEEE Access 7(2019), 19539–19549.
[20]
Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural collaborative filtering. In Proceedings of the 26th international conference on world wide web. 173–182.
[21]
Jonathan L Herlocker, Joseph A Konstan, Loren G Terveen, and John T Riedl. 2004. Evaluating collaborative filtering recommender systems. ACM Transactions on Information Systems (TOIS) 22, 1 (2004), 5–53.
[22]
Jizhou Huang, Shiqiang Ding, Haifeng Wang, and Ting Liu. 2018. Learning to recommend related entities with serendipity for web search users. ACM Transactions on Asian and Low-Resource Language Information Processing (TALLIP) 17, 3 (2018), 1–22.
[23]
Marius Kaminskas and Derek Bridge. 2016. Diversity, serendipity, novelty, and coverage: a survey and empirical analysis of beyond-accuracy objectives in recommender systems. ACM Transactions on Interactive Intelligent Systems (TiiS) 7, 1(2016), 1–42.
[24]
Jacob Devlin Ming-Wei Chang Kenton and Lee Kristina Toutanova. 2019. Bert: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of naacL-HLT, Vol. 1. 2.
[25]
Denis Kotkov, Joseph A Konstan, Qian Zhao, and Jari Veijalainen. 2018. Investigating serendipity in recommender systems based on real user feedback. In Proceedings of the 33rd annual acm symposium on applied computing. 1341–1350.
[26]
Youfang Leng, Li Yu, and Xi Niu. 2022. Dynamically aggregating individuals’ social influence and interest evolution for group recommendations. Information Sciences 614(2022), 223–239.
[27]
Bin Li. 2011. Cross-domain collaborative filtering: A brief survey. In 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence. IEEE, 1085–1086.
[28]
Bin Li, Qiang Yang, and Xiangyang Xue. 2009. Can movies and books collaborate? cross-domain collaborative filtering for sparsity reduction. In Twenty-First international joint conference on artificial intelligence.
[29]
Bin Li, Qiang Yang, and Xiangyang Xue. 2009. Transfer learning for collaborative filtering via a rating-matrix generative model. In Proceedings of the 26th annual international conference on machine learning. 617–624.
[30]
Huiyuan Li, Li Yu, Xi Niu, Youfang Leng, and Qihan Du. 2023. Sequential and graphical cross-domain recommendations with a multi-view hierarchical transfer gate. ACM Transactions on Knowledge Discovery from Data 18, 1 (2023), 1–28.
[31]
Pan Li, Maofei Que, Zhichao Jiang, Yao Hu, and Alexander Tuzhilin. 2020. PURS: personalized unexpected recommender system for improving user satisfaction. In Fourteenth ACM Conference on Recommender Systems. 279–288.
[32]
Pan Li and Alexander Tuzhilin. 2020. Ddtcdr: Deep dual transfer cross domain recommendation. In Proceedings of the 13th International Conference on Web Search and Data Mining. 331–339.
[33]
Xueqi Li, Wenjun Jiang, Weiguang Chen, Jie Wu, and Guojun Wang. 2019. Haes: A new hybrid approach for movie recommendation with elastic serendipity. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. 1503–1512.
[34]
Xueqi Li, Wenjun Jiang, Weiguang Chen, Jie Wu, Guojun Wang, and Kenli Li. 2020. Directional and explainable serendipity recommendation. In Proceedings of The Web Conference 2020. 122–132.
[35]
Xiaohan Li, Zheng Liu, Luyi Ma, Kaushiki Nag, Stephen Guo, S Yu Philip, and Kannan Achan. 2022. Mitigating frequency bias in next-basket recommendation via deconfounders. In 2022 IEEE International Conference on Big Data (Big Data). IEEE, 616–625.
[36]
Weiming Liu, Xiaolin Zheng, Mengling Hu, and Chaochao Chen. 2022. Collaborative filtering with attribution alignment for review-based non-overlapped cross domain recommendation. In Proceedings of the ACM Web Conference 2022. 1181–1190.
[37]
Julian McAuley, Christopher Targett, Qinfeng Shi, and Anton Van Den Hengel. 2015. Image-based recommendations on styles and substitutes. In Proceedings of the 38th international ACM SIGIR conference on research and development in information retrieval. 43–52.
[38]
Lori McCay-Peet and Elaine G Toms. 2010. The process of serendipity in knowledge work. In Proceedings of the third symposium on Information interaction in context. 377–382.
[39]
William McKeen. 2006. The Endangered Joy of Serendipity. St. Petersburg Times(2006).
[40]
Robert K Merton and Elinor Barber. 2011. The travels and adventures of serendipity. In The Travels and Adventures of Serendipity. Princeton University Press.
[41]
Orly Moreno, Bracha Shapira, Lior Rokach, and Guy Shani. 2012. Talmud: transfer learning for multiple domains. In Proceedings of the 21st ACM international conference on Information and knowledge management. 425–434.
[42]
Xi Niu. 2018. An adaptive recommender system for computational serendipity. In Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval. 215–218.
[43]
Xi Niu and Fakhri Abbas. 2017. A framework for computational serendipity. In Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization. 360–363.
[44]
Xi Niu and Fakhri Abbas. 2019. Computational surprise, perceptual surprise, and personal background in text understanding. In Proceedings of the 2019 Conference on Human Information Interaction and Retrieval. 343–347.
[45]
Xi Niu, Fakhri Abbas, Mary Lou Maher, and Kazjon Grace. 2018. Surprise me if you can: Serendipity in health information. In Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems. 1–12.
[46]
Xi Niu, Chuqin Li, and Xing Yu. 2017. Predictive analytics of E-commerce search behavior for conversion. (2017).
[47]
Xi Niu, Wlodek Zadrozny, Kazjon Grace, and Weimao Ke. 2018. Computational surprise in information retrieval. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. 1427–1429.
[48]
Gaurav Pandey, Denis Kotkov, and Alexander Semenov. 2018. Recommending serendipitous items using transfer learning. In Proceedings of the 27th ACM international conference on information and knowledge management. 1771–1774.
[49]
Theodore G Remer. 1965. Serendipity and the three princes: From the Peregrinaggio of 1557. University of Oklahoma Press.
[50]
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2012. BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618(2012).
[51]
Victoria L Rubin, Jacquelyn Burkell, and Anabel Quan-Haase. 2011. Facets of Serendipity in Everyday Chance Encounters: a Grounded Theory Approach to Blog Analysis.Information Research 16, 3 (2011).
[52]
Yue Shi, Xiaoxue Zhao, Jun Wang, Martha Larson, and Alan Hanjalic. 2012. Adaptive diversification of recommendation results via latent factor portfolio. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval. 175–184.
[53]
Fei Sun, Jun Liu, Jian Wu, Changhua Pei, Xiao Lin, Wenwu Ou, and Peng Jiang. 2019. BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In Proceedings of the 28th ACM international conference on information and knowledge management. 1441–1450.
[54]
Jennifer Thom-Santelli. 2007. Mobile Social Software: Facilitating Serendipity or Encouraging Homogeneity?IEEE Pervasive Computing 6, 3 (2007), 46.
[55]
Saúl Vargas and Pablo Castells. 2014. Improving sales diversity by recommending users to items. In Proceedings of the 8th ACM Conference on Recommender systems. 145–152.
[56]
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in neural information processing systems 30 (2017).
[57]
Sowmini Devi Veeramachaneni, Arun K Pujari, Vineet Padmanabhan, and Vikas Kumar. 2019. A maximum margin matrix factorization based transfer learning approach for cross-domain recommendation. Applied Soft Computing 85 (2019), 105751.
[58]
Yuanbo Xu, Yongjian Yang, En Wang, Jiayu Han, Fuzhen Zhuang, Zhiwen Yu, and Hui Xiong. 2020. Neural serendipity recommendation: Exploring the balance between accuracy and novelty with sparse explicit feedback. ACM Transactions on Knowledge Discovery from Data (TKDD) 14, 4(2020), 1–25.
[59]
Ting Yu, Junpeng Guo, Wenhua Li, and Meng Lu. 2021. A mixed heterogeneous factorization model for non-overlapping cross-domain recommendation. Decision Support Systems 151 (2021), 113625.
[60]
Yizhou Zang and Xiaohua Hu. 2017. LKT-FM: A novel rating pattern transfer model for improving non-overlapping cross-domain collaborative filtering. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2017, Skopje, Macedonia, September 18–22, 2017, Proceedings, Part II 10. Springer, 641–656.
[61]
Mingwei Zhang, Yang Yang, Rizwan Abbas, Ke Deng, Jianxin Li, and Bin Zhang. 2021. SNPR: A Serendipity-Oriented Next POI Recommendation Model. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 2568–2577.
[62]
Qian Zhang, Dianshuang Wu, Jie Lu, Feng Liu, and Guangquan Zhang. 2017. A cross-domain recommender system with consistent information transfer. Decision Support Systems 104 (2017), 49–63.
[63]
Feng Zhu, Yan Wang, Chaochao Chen, Guanfeng Liu, and Xiaolin Zheng. 2020. A graphical and attentional framework for dual-target cross-domain recommendation. In IJCAI. 3001–3008.
Index Terms
- A Deep Learning Model for Cross-Domain Serendipity Recommendations
Index terms have been assigned to the content through auto-classification.
Recommendations
Rethinking Serendipity in Recommender Systems
CHIIR '23: Proceedings of the 2023 Conference on Human Information Interaction and RetrievalRecommender systems suggest items, such as movies or books, to users based on their interests. These systems often suggest items that users are either already familiar with or could easily have found on their own without additional assistance. To ...
Investigating serendipity in recommender systems based on real user feedback
SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied ComputingOver the past several years, research in recommender systems has emphasized the importance of serendipity, but there is still no consensus on the definition of this concept and whether serendipitous items should be recommended is still not a well-...
A survey of serendipity in recommender systems
We summarize most efforts on serendipity in recommender systems.We compare definitions of serendipity in recommender systems.We classify the state-of-the-art serendipity-oriented recommendation algorithms.We review methods to assess serendipity in ...
Comments
Information & Contributors
Information
Published In
EISSN:2770-6699
Table of ContentsCopyright © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Online AM: 29 August 2024
Accepted: 01 August 2024
Revised: 17 May 2024
Received: 17 August 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 326Total Downloads
- Downloads (Last 12 months)326
- Downloads (Last 6 weeks)53
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in