{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:23:22Z","timestamp":1772083402434,"version":"3.50.1"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1910696"],"award-info":[{"award-number":["1910696"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Recomm. Syst."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>\n            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\n            <jats:italic>SerenCDR<\/jats:italic>\n            , to model serendipity.\n            <jats:italic>SerenCDR<\/jats:italic>\n            leverages the knowledge beyond one domain as well as mitigates the inherent data sparsity problem in serendipity recommendations. The novelty of\n            <jats:italic>SerenCDR<\/jats:italic>\n            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 is nearly impossible. To train and test\n            <jats:italic>SerenCDR<\/jats:italic>\n            , we have collected a two-domain ground truth dataset on serendipity, called\n            <jats:italic>SerenCDRLens<\/jats:italic>\n            . In addition, since we found that serendipity is sparse in\n            <jats:italic>SerenCDRLens<\/jats:italic>\n            , 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.\n          <\/jats:p>","DOI":"10.1145\/3690654","type":"journal-article","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T09:44:26Z","timestamp":1724924666000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Deep Learning Model for Cross-Domain Serendipity Recommendations"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3097-8451","authenticated-orcid":false,"given":"Zhe","family":"Fu","sequence":"first","affiliation":[{"name":"Software and Information Systems, The University of North Carolina at Charlotte, Charlotte, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5418-6969","authenticated-orcid":false,"given":"Xi","family":"Niu","sequence":"additional","affiliation":[{"name":"Software and Information Systems, The University of North Carolina at Charlotte, Charlotte, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8795-0487","authenticated-orcid":false,"given":"Xiangcheng","family":"Wu","sequence":"additional","affiliation":[{"name":"Software and Information Systems, The University of North Carolina at Charlotte, Charlotte, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3492-7843","authenticated-orcid":false,"given":"Ruhani","family":"Rahman","sequence":"additional","affiliation":[{"name":"Computer Science, The University of North Carolina at Charlotte, Charlotte, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA47632.2019.9035339"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_27"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3522762"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.708"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.57"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3205849"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3617598"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3664190.3672521"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605145"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591787"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313538"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/21650349.2014.943295"},{"issue":"7","key":"e_1_3_2_15_2","first-page":"48","article-title":"Technology and the end of serendipity","volume":"63","author":"Gup Ted","year":"1998","unstructured":"Ted Gup. 1998. Technology and the end of serendipity. Education Digest 63, 7 (1998), 48.","journal-title":"Education Digest"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583402"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159675"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2896881"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3185663"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2926720"},{"key":"e_1_3_2_24_2","volume-title":"Proceedings of the 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT\u201919)","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of the 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT\u201919). 4171\u20134186."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167276"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.09.058"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.184"},{"key":"e_1_3_2_28_2","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence","author":"Li Bin","year":"2009","unstructured":"Bin Li, Qiang Yang, and Xiangyang Xue. 2009. Can movies and books collaborate? Cross-domain collaborative filtering for sparsity reduction. In Proceedings of the 21st International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553454"},{"issue":"1","key":"e_1_3_2_30_2","first-page":"1","article-title":"Sequential and graphical cross-domain recommendations with a multi-view hierarchical transfer gate","volume":"18","author":"Li Huiyuan","year":"2023","unstructured":"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\u201328.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412238"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371793"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357868"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380100"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10021135"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512166"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1840784.1840842"},{"key":"e_1_3_2_39_2","article-title":"The Endangered joy of serendipity","author":"McKeen William","year":"2006","unstructured":"William McKeen. 2006. The Endangered joy of serendipity. St. Petersburg Times, March 26, 2006.","journal-title":"St. Petersburg Times,"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841523.230"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396817"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3234944.3234974"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3099023.3099097"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295750.3298963"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3173574.3173597"},{"key":"e_1_3_2_46_2","unstructured":"Xi Niu Chuqin Li and Xing Yu. 2017. Predictive analytics of E-commerce search behavior for conversion. In Proceedings of the 23rd Americas Conference on Information Systems."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210197"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269268"},{"key":"e_1_3_2_49_2","volume-title":"Serendipity and the Three Princes: From the Peregrinaggio of 1557","author":"Remer Theodore G.","year":"1965","unstructured":"Theodore G. Remer. 1965. Serendipity and the Three Princes: From the Peregrinaggio of 1557. University of Oklahoma Press."},{"key":"e_1_3_2_50_2","article-title":"BPR: Bayesian Personalized Ranking from implicit feedback","author":"Rendle Steffen","year":"2012","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2012. BPR: Bayesian Personalized Ranking from implicit feedback. arXiv preprint arXiv:1205.2618 (2012).","journal-title":"arXiv preprint arXiv:1205.2618"},{"issue":"3","key":"e_1_3_2_51_2","article-title":"Facets of serendipity in everyday chance encounters: A grounded theory approach to blog analysis.","volume":"16","author":"Rubin Victoria L.","year":"2011","unstructured":"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), Article 488.","journal-title":"Information Research"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348310"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357895"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2007.60"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645744"},{"key":"e_1_3_2_56_2","article-title":"Attention is all you need","volume":"30","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in Neural Information Processing Systems 30 (2017), 1\u201311.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105751"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3396607"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2021.113625"},{"key":"e_1_3_2_60_2","doi-asserted-by":"crossref","unstructured":"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. Lecture Notes in Computer Science Vol. 10535. Springer 641\u2013656.","DOI":"10.1007\/978-3-319-71246-8_39"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482394"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2017.10.002"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/415"}],"container-title":["ACM Transactions on Recommender Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690654","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690654","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:06Z","timestamp":1750294686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3690654"],"URL":"https:\/\/doi.org\/10.1145\/3690654","relation":{},"ISSN":["2770-6699"],"issn-type":[{"value":"2770-6699","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"2023-08-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}