{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:03:13Z","timestamp":1767646993334,"version":"3.48.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T00:00:00Z","timestamp":1764115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"vor","delay-in-days":16,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No.72161020"],"award-info":[{"award-number":["Grant No.72161020"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["Grant No. 20224BAB202023"],"award-info":[{"award-number":["Grant No. 20224BAB202023"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangxi Province Technological Innovation Base Program","award":["Grant No.20242BCC32021"],"award-info":[{"award-number":["Grant No.20242BCC32021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper investigates the balancing problem between popularity bias and the long-tail distribution in bundle recommendation systems. Existing approaches often focus exclusively on recommending popular items or solely on recommending long-tail items. Such approaches fail to effectively balance their respective impacts, resulting in insufficient diversity in system recommendations. To address this issue, we propose the GAMNBRec model. The model introduces the graph-adaptive mixed normalization (AdaMixNorm) method, which dynamically adjusts normalization strategies based on interactive graph structures. This strategy balances recommendation performance between popular and long-tail items. It enhances the recommendation quality of long-tail items through adaptive normalization adjustments, while simultaneously preserving the quality of popular item recommendations. In addition, GAMNBRec incorporates a residual-enhanced dynamic feature fusion mechanism to prevent feature loss for long-tail items in deep networks. It also integrates a Softmax-weighted BPR contrastive loss, which dynamically adjusts the importance of negative samples and thereby improves model training effectiveness. Experiments on the NetEase, Youshu, and iFashion datasets demonstrate that GAMNBRec significantly outperforms existing state-of-the-art methods in both Recall and NDCG metrics. These results validate the effectiveness and innovation of GAMNBRec in balancing recommendations for popular items and long-tail items.<\/jats:p>","DOI":"10.1007\/s44443-025-00388-6","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T13:05:04Z","timestamp":1764162304000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph adaptive mix normalization in bundle recommendation: Balancing popularity bias and long-tail effect"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5246-796X","authenticated-orcid":false,"given":"Bing","family":"Li","sequence":"first","affiliation":[]},{"given":"ZiJun","family":"Lin","sequence":"additional","affiliation":[]},{"given":"XiaoJian","family":"Xing","sequence":"additional","affiliation":[]},{"given":"XiLe","family":"Wang","sequence":"additional","affiliation":[]},{"given":"JiangTao","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,26]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286. https:\/\/doi.org\/10.1126\/science.286.5439.509","key":"388_CR1","DOI":"10.1126\/science.286.5439.509"},{"unstructured":"Cai X, Huang C, Xia L, Ren X (2023) Lightgcl: Simple yet effective graph contrastive learning for recommendation","key":"388_CR2"},{"key":"388_CR3","doi-asserted-by":"publisher","first-page":"2326","DOI":"10.1109\/TKDE.2021.3114586","volume":"35","author":"J Chang","year":"2023","unstructured":"Chang J, Gao C, He X, Jin D, Li Y (2023) Bundle recommendation and generation with graph neural networks. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 35:2326\u20132340. https:\/\/doi.org\/10.1109\/TKDE.2021.3114586","journal-title":"IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING"},{"doi-asserted-by":"crossref","unstructured":"Chen L, Liu Y, He X, Gao L, Zheng Z (2019) Matching user with item set: collaborative bundle recommendation with deep attention network. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, Palo Alto, California, USA, pp. 2095\u20132101. AAAI Press","key":"388_CR4","DOI":"10.24963\/ijcai.2019\/290"},{"doi-asserted-by":"publisher","unstructured":"Chen R, Fan J, Wu M, Cheng R, Song J (2025) G-diff: A graph-based decoding network for diffusion recommender model. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 36:10334\u201310347. https:\/\/doi.org\/10.1109\/TNNLS.2024.3491827","key":"388_CR5","DOI":"10.1109\/TNNLS.2024.3491827"},{"doi-asserted-by":"crossref","unstructured":"Deng Q, Wang K, Zhao M, Zou Z, Wu R, Tao J, Fan C, Chen L (2020) Personalized bundle recommendation in online games. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management, New York, NY, USA, pp. 2381\u20132388. Association for Computing Machinery","key":"388_CR6","DOI":"10.1145\/3340531.3412734"},{"doi-asserted-by":"publisher","unstructured":"Duan L, Zhu L, Ren P (2025) A dynamic cross-domain recommendation model with target-aware complementary preference transfer and information fusion. Eng Appl Artif Intell 148. https:\/\/doi.org\/10.1016\/j.engappai.2025.110404","key":"388_CR7","DOI":"10.1016\/j.engappai.2025.110404"},{"unstructured":"Ebrahimi N, Zhang Z, Stefanidis K (2025) A diversity-aware approach to bundle recommendations. In Proceedings of the 27th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2025), pp. 49\u201353. CEUR-WS","key":"388_CR8"},{"doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: Simplifying and powering graph convolution network for recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA, pp. 639\u2013648. Association for Computing Machinery","key":"388_CR9","DOI":"10.1145\/3397271.3401063"},{"doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua TS (2017) Neural collaborative filtering. In Proceedings of the 26th International Conference on World Wide Web, Republic and Canton of Geneva, CHE, pp. 173\u2013182. International World Wide Web Conferences Steering Committee","key":"388_CR10","DOI":"10.1145\/3038912.3052569"},{"doi-asserted-by":"crossref","unstructured":"Jeon H, Kim J, Lee J, J.e. Lee, and U. Kang, (2023) Aggregately diversified bundle recommendation via popularity debiasing and configuration-aware reranking. In: Kashima H, Ide T, Peng W-C (eds) Advances in Knowledge Discovery and Data Mining. Cham, Springer Nature Switzerland, pp 348\u2013360","key":"388_CR11","DOI":"10.1007\/978-3-031-33380-4_27"},{"doi-asserted-by":"crossref","unstructured":"Jeon H, Lee Je, Yun J, Kang U (2024) Cold-start bundle recommendation via popularity-based coalescence and curriculum heating. In Proceedings of the ACM Web Conference 2024, New York, NY, USA, pp. 3277\u20133286. Association for Computing Machinery","key":"388_CR12","DOI":"10.1145\/3589334.3645377"},{"doi-asserted-by":"crossref","unstructured":"Li M, Tian J, Li H, Zhang Q, Li X, Xu X (2025) Cabrec: A category-aware bundle recommendation model. In Proceedings of the 2025 International Conference on Multimedia Retrieval, New York, NY, USA, pp. 770\u2013778. Association for Computing Machinery","key":"388_CR13","DOI":"10.1145\/3731715.3733284"},{"doi-asserted-by":"publisher","unstructured":"Li M, Zhang L, Cui L, Bai L, Li Z, Wu X (2023) Blog: Bootstrapped graph representation learning with local and global regularization for recommendation. Pattern Recogn 144. https:\/\/doi.org\/10.1016\/j.patcog.2023.109874","key":"388_CR14","DOI":"10.1016\/j.patcog.2023.109874"},{"key":"388_CR15","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TSC.2025.3547219","volume":"18","author":"M Liu","year":"2025","unstructured":"Liu M, Wu G, Xu H, Wang J, Xu X, Wang Z (2025) Adaflow: Learning and utilizing workflows for enhanced service recommendation in dynamic environments. IEEE Trans Serv Comput 18:572\u2013585. https:\/\/doi.org\/10.1109\/TSC.2025.3547219","journal-title":"IEEE Trans Serv Comput"},{"key":"388_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1109\/TNNLS.2022.3177611","volume":"35","author":"T Liu","year":"2024","unstructured":"Liu T, Lou S, Liao J, Feng H (2024) Dynamic and static representation learning network for recommendation. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 35:831\u2013841. https:\/\/doi.org\/10.1109\/TNNLS.2022.3177611","journal-title":"IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS"},{"doi-asserted-by":"publisher","unstructured":"Ma Y, He Y, Wang X, Wei Y, Du X, Fu Y, Chua TS (2024) Multicbr: Multi-view contrastive learning for bundle recommendation. ACM TRANSACTIONS ON INFORMATION SYSTEMS 42. https:\/\/doi.org\/10.1145\/3640810","key":"388_CR17","DOI":"10.1145\/3640810"},{"doi-asserted-by":"crossref","unstructured":"Ma Y, He Y, Zhang A, Wang X, Chua TS (2022) Crosscbr: Cross-view contrastive learning for bundle recommendation. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, New York, NY, USA, pp. 1233\u20131241. Association for Computing Machinery","key":"388_CR18","DOI":"10.1145\/3534678.3539229"},{"doi-asserted-by":"crossref","unstructured":"Ma Y, Liu X, Wei Y, Tao Z, Wang X, Chua TS (2024) Leveraging multimodal features and item-level user feedback for bundle construction. In Proceedings of the 17th ACM International Conference on Web Search and Data Mining, New York, NY, USA, pp. 510\u2013519. Association for Computing Machinery","key":"388_CR19","DOI":"10.1145\/3616855.3635854"},{"doi-asserted-by":"publisher","unstructured":"\u00c1ngeles Serrano M, Bogu\u00f1\u00e1 M, Vespignani A (2009) Extracting the multiscale backbone of complex weighted networks. Proc Natl Acad Sci 106. https:\/\/doi.org\/10.1073\/pnas.0808904106","key":"388_CR20","DOI":"10.1073\/pnas.0808904106"},{"doi-asserted-by":"publisher","unstructured":"Qiu N, Gao B, Tu H, Huang F, Guan Q, Luo W (2022) Ldgc-sr: Integrating long-range dependencies and global context information for session-based recommendation. Knowl-Based Syst 248. https:\/\/doi.org\/10.1016\/j.knosys.2022.108894","key":"388_CR21","DOI":"10.1016\/j.knosys.2022.108894"},{"unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2012) Bpr: Bayesian personalized ranking from implicit feedback","key":"388_CR22"},{"doi-asserted-by":"publisher","unstructured":"Song S, Liu B, Teng F, Li T (2025) Self-supervised contrastive learning for implicit collaborative filtering. Eng Appl Artif Intell 139. https:\/\/doi.org\/10.1016\/j.engappai.2024.109563","key":"388_CR23","DOI":"10.1016\/j.engappai.2024.109563"},{"doi-asserted-by":"publisher","unstructured":"Tang H, Zhao G, He Y, Wu Y, Qian X (2023) Ranking-based contrastive loss for recommendation systems. Knowl-Based Syst 261. https:\/\/doi.org\/10.1016\/j.knosys.2022.110180","key":"388_CR24","DOI":"10.1016\/j.knosys.2022.110180"},{"key":"388_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2025.113771","volume":"324","author":"D Wang","year":"2025","unstructured":"Wang D, Li Z, Yang S, Ren T, Zhang P, Deng P, Li T (2025) Ndridc: Nmf-based deep representation algorithm for incomplete data clustering. Knowl-Based Syst 324:113771. https:\/\/doi.org\/10.1016\/j.knosys.2025.113771","journal-title":"Knowl-Based Syst"},{"doi-asserted-by":"crossref","unstructured":"Wang H, Xu Y, Yang C, Shi C, Li X, Guo N, Liu Z (2023) Knowledge-adaptive contrastive learning for recommendation. In Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, New York, NY, USA, pp. 535\u2013543. Association for Computing Machinery","key":"388_CR26","DOI":"10.1145\/3539597.3570483"},{"doi-asserted-by":"crossref","unstructured":"Wu J, Wang X, Feng F, He X, Chen L, Lian J, Xie X (2021) Self-supervised graph learning for recommendation. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA, pp. 726\u2013735. Association for Computing Machinery","key":"388_CR27","DOI":"10.1145\/3404835.3462862"},{"doi-asserted-by":"publisher","unstructured":"Xiao S, Zhu D, Tang C, Huang Z (2023) Combining graph contrastive embedding and multi-head cross-attention transfer for cross-domain recommendation. DATA SCIENCE AND ENGINEERING 8:247\u2013262. https:\/\/doi.org\/10.1007\/s41019-023-00226-7","key":"388_CR28","DOI":"10.1007\/s41019-023-00226-7"},{"issue":"7","key":"388_CR29","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1007\/s11263-022-01622-8","volume":"130","author":"L Yang","year":"2022","unstructured":"Yang L, Jiang H, Song Q, Guo J (2022) A survey on long-tailed visual recognition. Int J Comput Vision 130(7):1837\u20131872","journal-title":"Int J Comput Vision"},{"doi-asserted-by":"publisher","unstructured":"Yu C, Zhao J, Wu X, Luo Y, Xiao Y (2025) Tpgrec: Text-enhanced and popularity-smoothing graph collaborative filtering for long-tail item recommendation. Neurocomputing 626. https:\/\/doi.org\/10.1016\/j.neucom.2025.129539","key":"388_CR30","DOI":"10.1016\/j.neucom.2025.129539"},{"doi-asserted-by":"publisher","unstructured":"Yu D, Yu T, Wang D, Wang S (2024) Long tail service recommendation based on cross-view and contrastive learning. Expert Syst Appl 238. https:\/\/doi.org\/10.1016\/j.eswa.2023.121957","key":"388_CR31","DOI":"10.1016\/j.eswa.2023.121957"},{"doi-asserted-by":"publisher","unstructured":"Yu Z, Li J, Chen L, Zheng Z (2022) Unifying multi-associations through hypergraph for bundle recommendation. Knowl-Based Syst 255. https:\/\/doi.org\/10.1016\/j.knosys.2022.109755","key":"388_CR32","DOI":"10.1016\/j.knosys.2022.109755"},{"doi-asserted-by":"publisher","unstructured":"Zhang P, Niu Z, Ma R, Zhang F (2024) Dhcl-br: Dual hypergraph contrastive learning for bundle recommendation. COMPUTER JOURNAL 67:2906\u20132919. https:\/\/doi.org\/10.1093\/comjnl\/bxae056","key":"388_CR33","DOI":"10.1093\/comjnl\/bxae056"},{"doi-asserted-by":"publisher","unstructured":"Zhang Z, Wang A, Zhang Y, Ren Y, Li W, Wang B, Inuiguchi M (2024) Relation pruning and discriminative sampling over knowledge graph for long-tail recommendation. Inf Sci 679. https:\/\/doi.org\/10.1016\/j.ins.2024.120871","key":"388_CR34","DOI":"10.1016\/j.ins.2024.120871"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00388-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00388-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00388-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:47:45Z","timestamp":1767638865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00388-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,26]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["388"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00388-6","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,11,26]]},"assertion":[{"value":"9 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest,we do not have any possible conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"361"}}