{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:22:00Z","timestamp":1771003320212,"version":"3.50.1"},"reference-count":14,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T00:00:00Z","timestamp":1742342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"Jiangsu Philosophy and Social Science Foundation Subject 23TQB005, Project of Jiangsu Province Education Department","award":["2021SJA1715"],"award-info":[{"award-number":["2021SJA1715"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p>The traditional library recommendation method mainly relies on manual analysis of readers\u2019 reading history, book classification, and user feedback to achieve personalized recommendation, but this method has limitations such as low efficiency and difficulty in accurately capturing users\u2019 complex needs. In view of this, this paper innovatively designs a recommendation system based on Wide &amp; Deep model. The system utilizes a linear model (Wide part) to process hand-constructed features as a way to remember specific user behavioural patterns; at the same time, high-dimensional sparse features are processed with the help of a deep neural network (Deep part) to capture the complex relationship between user interests. After both outputs are further processed by the fully connected layer, the model outputs the probability distribution of each category through Softmax function and then predicts the book categories that users may be interested in. The experimental results show that the model has excellent performance, with an AUC score of over 99%, showing a strong differentiation ability; precision is close to 97%, recall is close to 96%, and F1 value is close to 54%, which not only can accurately recommend the book resources that the user is interested in but also can effectively cover the diversified needs of the user, and provide a better solution for personalized recommendation service in libraries.<\/jats:p>","DOI":"10.1177\/14727978251327135","type":"journal-article","created":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:21:51Z","timestamp":1742376111000},"page":"3889-3901","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["A study of a personalized library recommendation algorithm"],"prefix":"10.1177","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5824-1339","authenticated-orcid":false,"given":"Ai","family":"Wang","sequence":"first","affiliation":[{"name":"Library of Jiangsu Ocean University, Lianyungang, Jiangsu, China"}]},{"given":"Ming Wei","family":"Li","sequence":"additional","affiliation":[{"name":"Library of Jiangsu Ocean University, Lianyungang, Jiangsu, China"}]},{"given":"Shuai","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Jiangsu Ocean University, Lianyungang, Jiangsu, China"}]}],"member":"179","published-online":{"date-parts":[[2025,3,19]]},"reference":[{"issue":"10","key":"e_1_3_3_2_2","first-page":"2458","article-title":"Personalised book recommendation system for colleges and universities based on improved user collaborative filtering algorithm","volume":"48","author":"Liu J","year":"2020","unstructured":"Liu J, Quan Quan W. Personalised book recommendation system for colleges and universities based on improved user collaborative filtering algorithm. Computer and Digital Engineering 2020; 48(10): 2458\u20132461.","journal-title":"Computer and Digital Engineering"},{"issue":"08","key":"e_1_3_3_3_2","first-page":"1613","article-title":"An improved collaborative filtering recommendation algorithm incorporating trustworthiness values and semi-supervised density peak clustering","volume":"41","author":"Kunlun L","year":"2020","unstructured":"Kunlun L, meng WM, Zhi Bo Y, et al. An improved collaborative filtering recommendation algorithm incorporating trustworthiness values and semi-supervised density peak clustering. Small Microcomputer Systems 2020; 41(08): 1613\u20131619.","journal-title":"Small Microcomputer Systems"},{"issue":"04","key":"e_1_3_3_4_2","first-page":"34","article-title":"Fusion of context information and kernel density estimation for collaborative filtering recommendation","volume":"31","author":"Ma R","year":"2021","unstructured":"Ma R, Fang Qing G, Liu Z, et al. Fusion of context information and kernel density estimation for collaborative filtering recommendation. Computer Technology and Development 2021; 31(04): 34\u201339.","journal-title":"Computer Technology and Development"},{"issue":"05","key":"e_1_3_3_5_2","first-page":"38","article-title":"A personalised recommendation method for network information resources based on generalised regression neural network","volume":"35","author":"Wu ET","year":"2023","unstructured":"Wu ET. A personalised recommendation method for network information resources based on generalised regression neural network. Information and Computer (Theoretical Edition) 2023; 35(05): 38\u201340.","journal-title":"Information and Computer (Theoretical Edition)"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-022-00592-5"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/T4E.2019.00033"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-191721"},{"issue":"5","key":"e_1_3_3_9_2","first-page":"4425","article-title":"A survey on accuracy-oriented neural recommendation: From collaborative filtering to information-rich recommendation","volume":"35","author":"Wu L","year":"2022","unstructured":"Wu L, He H, Wang H, et al. A survey on accuracy-oriented neural recommendation: From collaborative filtering to information-rich recommendation. IEEE Trans Knowl Data Eng 2022; 35(5): 4425\u20134445.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-023-05519-2"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121555"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121541"},{"key":"e_1_3_3_13_2","first-page":"3209140","article-title":"A personalized recommendation algorithm based on weighted information entropy and particle swarm optimization","volume":"1","author":"Jiang S","year":"2021","unstructured":"Jiang S, Ding J, Zhang L. A personalized recommendation algorithm based on weighted information entropy and particle swarm optimization. Mob Inf Syst 2021; 1: 3209140\u20133209149.","journal-title":"Mob Inf Syst"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcom.2024.100719"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.3389\/feduc.2022.866049"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251327135","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14727978251327135","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251327135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:31:54Z","timestamp":1771000314000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14727978251327135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,19]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10.1177\/14727978251327135"],"URL":"https:\/\/doi.org\/10.1177\/14727978251327135","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,19]]}}}