{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T21:44:45Z","timestamp":1780609485564,"version":"3.54.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["KL 2698\/2-1"],"award-info":[{"award-number":["KL 2698\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Federal Ministry of Science and Education","doi-asserted-by":"publisher","award":["031L0023A"],"award-info":[{"award-number":["031L0023A"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Federal Ministry of Science and Education","doi-asserted-by":"publisher","award":["01IS18051A"],"award-info":[{"award-number":["01IS18051A"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Federal Ministry of Science and Education","doi-asserted-by":"publisher","award":["031B0770E"],"award-info":[{"award-number":["031B0770E"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tnnls.2021.3106155","type":"journal-article","created":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T19:58:22Z","timestamp":1630612702000},"page":"2259-2270","source":"Crossref","is-referenced-by-count":10,"title":["Orthogonal Inductive Matrix Completion"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8440-2784","authenticated-orcid":false,"given":"Antoine","family":"Ledent","sequence":"first","affiliation":[{"name":"TU Kaiserslautern, Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7458-5281","authenticated-orcid":false,"given":"Rodrigo","family":"Alves","sequence":"additional","affiliation":[{"name":"TU Kaiserslautern, Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6829-3725","authenticated-orcid":false,"given":"Marius","family":"Kloft","sequence":"additional","affiliation":[{"name":"TU Kaiserslautern, Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Online matrix completion with side information","author":"herbster","year":"2019","journal-title":"arXiv 1906 07255"},{"key":"ref12","first-page":"5756","article-title":"Fast and sample efficient inductive matrix completion via multi-phase procrustes flow","volume":"80","author":"zhang","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref15","first-page":"3619","article-title":"SVDFeature: A toolkit for feature-based collaborative filtering","volume":"13","author":"chen","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"ref11","first-page":"1","volume":"81","author":"bell","year":"2009","journal-title":"The BellKor Solution to the Netflix Prize"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29659-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.9967"},{"key":"ref17","first-page":"3005","article-title":"Using side information to reliably learn low-rank matrices from missing and corrupted observations","volume":"19","author":"chiang","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref16","article-title":"Provable inductive matrix completion","author":"jain","year":"2013","journal-title":"arXiv 1306 0626"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2021.05.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16354-3_35"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.382009"},{"key":"ref23","first-page":"981","article-title":"A unified computational and statistical framework for nonconvex low-rank matrix estimation","volume":"54","author":"wang","year":"2017","journal-title":"Proc 20th Int Conf Artif Intell Statist"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"ref25","first-page":"3367","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","volume":"16","author":"hastie","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref20","article-title":"A sparse interactive model for matrix completion with side information","volume":"29","author":"lu","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref21","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","volume":"28","author":"zheng","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2018","journal-title":"arXiv 1810 04805"},{"key":"ref27","author":"yang","year":"2019","journal-title":"Douban Movie and NetEase Music Datasets and Model Code"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1248"},{"key":"ref8","first-page":"952","article-title":"Matrix completion from noisy entries","author":"keshavan","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jpclett.9b03657"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339612"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref5","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10114428\/09527398.pdf?arnumber=9527398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:55:54Z","timestamp":1684778154000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9527398\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":29,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2021.3106155","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}