{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:00:39Z","timestamp":1784178039212,"version":"3.55.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:00:00Z","timestamp":1722556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Recomm. Syst."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>This empirical study addresses the problem of Next Basket Repurchase Recommendation (NBRR), an often overlooked aspect of Next Basket Recommendation (NBR). While NBR aims to suggest items for a user\u2019s next basket based on their prior basket history, NBRR focuses solely on recommending items previously purchased by the user. Despite the common ground between NBR and NBRR, the latter requires a distinct approach.<\/jats:p>\n          <jats:p>In this paper, we survey recent developments in the fields of NBR and NBRR, emphasizing the different strategies employed for these closely related challenges. In addition, we review the common characteristics of users\u2019 repurchase patterns, which characterize the NBRR problem. Building on these insights, we introduce a novel hyper-convolutional model tailored to capture behavioral patterns associated with repeated purchases. To evaluate its effectiveness, we conduct experiments on three publicly available datasets, offering a comprehensive analysis across three levels of granularity: user-level, order-level, and item-level.<\/jats:p>\n          <jats:p>Our analysis illuminates the conditions under which the model excels and identifies scenarios where it may encounter challenges. This research contributes valuable insights into enhancing repurchase recommendation systems and advancing the understanding of user purchase behavior in general.<\/jats:p>","DOI":"10.1145\/3652863","type":"journal-article","created":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T11:54:30Z","timestamp":1711022070000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Personalized Cadence Awareness for Next Basket Recommendation"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7390-2406","authenticated-orcid":false,"given":"Ori","family":"Katz","sequence":"first","affiliation":[{"name":"Microsoft, Herzliya, Israel and Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5059-0905","authenticated-orcid":false,"given":"Oren","family":"Barkan","sequence":"additional","affiliation":[{"name":"The Open University of Israel, Haifa Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8219-4512","authenticated-orcid":false,"given":"Noam","family":"Koenigstein","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel Aviv Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,2]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568018"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531708"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210129"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331199"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412226"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219891"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3325730.3325763"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/490\/6\/062062"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1979.10481038"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1080\/0267257X.2013.813576"},{"key":"e_1_3_2_12_2","volume-title":"What is the \u201cTrue Story\u201d About Data Mining, Beer and Diapers","year":"2002","unstructured":"DSSResources. 2002. What is the \u201cTrue Story\u201d About Data Mining, Beer and Diapers. DOI:http:\/\/www.dssresources.com\/newsletters\/66.php"},{"key":"e_1_3_2_13_2","volume-title":"The Complete Journey","year":"2017","unstructured":"Dunnhumby. 2017. The Complete Journey. DOI:https:\/\/www.dunnhumby.com\/source-files\/"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340631.3394850"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"issue":"4","key":"e_1_3_2_16_2","first-page":"409","article-title":"A survey on association rule mining in market basket analysis","volume":"4","author":"Gupta Savi","year":"2014","unstructured":"Savi Gupta and Roopal Mamtora. 2014. A survey on association rule mining in market basket analysis. International Journal of Information and Computation Technology 4, 4 (2014), 409\u2013414.","journal-title":"International Journal of Information and Computation Technology"},{"key":"e_1_3_2_17_2","article-title":"HyperNetworks","volume":"1609","author":"Ha David","year":"2016","unstructured":"David Ha, Andrew M. Dai, and Quoc V. Le. 2016. HyperNetworks. CoRR abs\/1609.09106 (2016). DOI:http:\/\/arxiv.org\/abs\/1609.09106","journal-title":"CoRR"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1470-6431.2007.00655.x"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401066"},{"key":"e_1_3_2_21_2","volume-title":"The Instacart Online Grocery Shopping Dataset 2017","year":"2017","unstructured":"Instacart. 2017. The Instacart Online Grocery Shopping Dataset 2017. DOI:https:\/\/www.instacart.com\/datasets\/grocery-shopping-2017"},{"key":"e_1_3_2_22_2","volume-title":"Acquire Valued Shoppers","year":"2013","unstructured":"Kaggle. 2013. Acquire Valued Shoppers. DOI:https:\/\/www.kaggle.com\/c\/acquire-valued-shoppers-challenge\/overview"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3546763"},{"key":"e_1_3_2_24_2","article-title":"Adam: A method for stochastic optimization","author":"Kingma Diederik P.","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014).","journal-title":"arXiv preprint arXiv:1412.6980"},{"key":"e_1_3_2_25_2","first-page":"4840","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","author":"Klein Benjamin","year":"2015","unstructured":"Benjamin Klein, Lior Wolf, and Yehuda Afek. 2015. A dynamic convolutional layer for short range weather prediction. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 4840\u20134848."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330791"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.17977\/um018v1i12018p20-25"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/389"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2930238.2930244"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557150"},{"issue":"4","key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3587153","article-title":"A next basket recommendation reality check","volume":"41","author":"Li Ming","year":"2023","unstructured":"Ming Li, Sami Jullien, Mozhdeh Ariannezhad, and Maarten de Rijke. 2023. A next basket recommendation reality check. ACM Transactions on Information Systems 41, 4 (2023), 1\u201329.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_32_2","article-title":"Efficient estimation of word representations in vector space","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013).","journal-title":"arXiv preprint arXiv:1301.3781"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICoICT.2015.7231468"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772773"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271786"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11851"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/523"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00759"},{"key":"e_1_3_2_39_2","article-title":"Pay less attention with lightweight and dynamic convolutions","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Angela Fan, Alexei Baevski, Yann N. Dauphin, and Michael Auli. 2019. Pay less attention with lightweight and dynamic convolutions. arXiv preprint arXiv:1901.10430 (2019).","journal-title":"arXiv preprint arXiv:1901.10430"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914683"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01199"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47717-6_5"}],"container-title":["ACM Transactions on Recommender Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652863","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3652863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:53:56Z","timestamp":1750287236000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,2]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3652863"],"URL":"https:\/\/doi.org\/10.1145\/3652863","relation":{},"ISSN":["2770-6699"],"issn-type":[{"value":"2770-6699","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,2]]},"assertion":[{"value":"2023-01-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}