{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:10:58Z","timestamp":1768277458317,"version":"3.49.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3557945","type":"journal-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T20:35:43Z","timestamp":1743798943000},"page":"67476-67487","source":"Crossref","is-referenced-by-count":4,"title":["Onto Proximality in Non Negative Matrix Factorization for Recommender Systems"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9683-6643","authenticated-orcid":false,"given":"Rachana","family":"Mehta","sequence":"first","affiliation":[{"name":"Computer Science and Engineering Department, School of Technology, Pandit Deendayal Energy University, Gandhinagar, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shakti","family":"Mishra","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering Department, School of Technology, Pandit Deendayal Energy University, Gandhinagar, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8458-604X","authenticated-orcid":false,"given":"Snehanshu","family":"Saha","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Systems and APPCAIR, BITS Pilani, K.K. Birla Goa Campus, Zuarinagar, Goa, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Impact of digital surge during COVID-19 pandemic: A viewpoint on research and practice","volume":"55","author":"Pandey","year":"2020","journal-title":"Int. J. Inf. Manage."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1921591.1921593"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2573314"},{"key":"ref5","first-page":"32","article-title":"High-dimensional data analysis: The curses and blessings of dimensionality","volume":"1","author":"Donoho","year":"2000","journal-title":"AMS Math Challenges Lect."},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2018.03.012"},{"key":"ref10","article-title":"A comparative study of collaborative filtering algorithms","author":"Lee","year":"2012","journal-title":"arXiv:1205.3193"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(98)00116-6"},{"issue":"3","key":"ref14","first-page":"543","article-title":"A method for unconstrained convex minimization problem with the rate of convergence o (1\/k2)","volume":"269","author":"Nesterov","year":"1983","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"issue":"61","key":"ref16","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","article-title":"ADADELTA: An adaptive learning rate method","author":"Zeiler","year":"2012","journal-title":"arXiv:1212.5701"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2884191"},{"key":"ref19","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"13","author":"Lee"},{"issue":"2","key":"ref20","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TII.2014.2308433","article-title":"An efficient non-negative matrixfactorization- based approach to collaborative filtering for recommender systems","volume":"10","author":"Luo","year":"2014","journal-title":"IEEE Trans. Ind. Informat."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2875452"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2021.3069108"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2605704"},{"key":"ref25","first-page":"35","article-title":"The Netflix prize","volume-title":"Proc. KDD Cup Workshop","author":"Bennett"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIDM.2019.099962"},{"key":"ref27","article-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016","journal-title":"arXiv:1609.04747"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531813"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2954859"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2891986"},{"key":"ref31","first-page":"823","article-title":"Two problems with backpropagation and other steepestdescent learning procedures for networks","volume-title":"Proc. Annu. Meeting Cognit. Sci. Soc.","author":"Sutton"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/83.661182"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.814255"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1117\/12.733532"},{"issue":"44","key":"ref36","first-page":"2","article-title":"A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing","volume":"43","author":"Hale","year":"2007"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref38","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate o (1\/k2)","volume":"269","author":"Nesterov","year":"1983","journal-title":"Dokl akad nauk SSSR"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.60"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref41","first-page":"2619","article-title":"A novel Bayesian similarity measure for recommender systems","volume-title":"Proc. 23rd Int. Joint Conf. Artif. Intell. (IJCAI)","author":"Guo"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10949215.pdf?arnumber=10949215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T17:43:46Z","timestamp":1749231826000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10949215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3557945","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}