{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:48:44Z","timestamp":1763664524316,"version":"build-2065373602"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2017YFE0135700"],"award-info":[{"award-number":["2017YFE0135700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["KP-06-IP-CHINA\/1"],"award-info":[{"award-number":["KP-06-IP-CHINA\/1"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001635","name":"Telecommunications Research Centre (TRC), University of Limerick, Ireland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001635","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3074365","type":"journal-article","created":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T04:39:28Z","timestamp":1618979968000},"page":"65266-65276","source":"Crossref","is-referenced-by-count":38,"title":["FeatureMF: An Item Feature Enriched Matrix Factorization Model for Item Recommendation"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3025-9609","authenticated-orcid":false,"given":"Haiyang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0535-7087","authenticated-orcid":false,"given":"Ivan","family":"Ganchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8022-0297","authenticated-orcid":false,"given":"Nikola S.","family":"Nikolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanlin","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mairtin","family":"O'Droma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.5194\/gmd-7-1247-2014"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"ref33","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"salakhutdinov","year":"2007","journal-title":"Proc 20th Int Conf Neural Inf Process Syst"},{"key":"ref32","first-page":"535","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2000","journal-title":"Proc 13th Int Conf Neural Inf Process Syst"},{"key":"ref31","first-page":"39","article-title":"Improving regularized singular value decomposition for collaborative filtering","author":"paterek","year":"2007","journal-title":"Proc ACM SIGKDD Int Conf Knowl Discovery Data Mining KDD Cup Workshop"},{"key":"ref30","first-page":"3","article-title":"The Netflix prize","author":"bennett","year":"2007","journal-title":"Proc ACM SIGKDD KDD Cup Workshop"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806528"},{"key":"ref36","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390267"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66854-3_18"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-016-9172-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2911720"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3291060"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/521"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-012-9124-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11184"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0841-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0553-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-016-0031-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347058"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3285029"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.2964552"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref29","article-title":"On the difficulty of evaluating baselines: A study on recommender systems","author":"rendle","year":"2019","journal-title":"arXiv 1905 01395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"journal-title":"Predicting Movie Ratings and Recommender Systems A 195-Page Monograph on Machine Learning Recommender Systems and the Netflix Prize","year":"2012","author":"paterek","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.05.039"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2528249"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IAEAC.2017.8054114"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCP.2016.7737124"},{"key":"ref42","first-page":"421","author":"bottou","year":"2012","journal-title":"ch Stochastic Gradient Descent Tricks"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806527"},{"key":"ref41","first-page":"693","article-title":"Hogwild!: A lock-free approach to parallelizing stochastic gradient descent","author":"niu","year":"2011","journal-title":"Proc 24th Int Conf Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/6783240"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219965"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346999"},{"key":"ref43","first-page":"1","article-title":"LibRec: A Java Library for Recommender Systems","volume":"4","author":"guo","year":"2015","journal-title":"Proc Posters Demos Late-Breaking Results Workshop Proc 23rd Conf User Modeling Adaptation Personalization (UMAP)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080689"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09409095.pdf?arnumber=9409095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:42Z","timestamp":1639770942000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9409095\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3074365","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}