{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:35:53Z","timestamp":1740101753241,"version":"3.37.3"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,4]]},"DOI":"10.1109\/icassp49357.2023.10096691","type":"proceedings-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:28:30Z","timestamp":1683307710000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Transductive Matrix Completion with Calibration for Multi-Task Learning"],"prefix":"10.1109","author":[{"given":"Hengfang","family":"Wang","sequence":"first","affiliation":[{"name":"Fujian Normal University"}]},{"given":"Yasi","family":"Zhang","sequence":"additional","affiliation":[{"name":"UCLA"}]},{"given":"Xiaojun","family":"Mao","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University"}]},{"given":"Zhonglei","family":"Wang","sequence":"additional","affiliation":[{"name":"Xiamen University"}]}],"member":"263","reference":[{"key":"ref13","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":"Journal of Machine Learning Research"},{"article-title":"Transduction with matrix completion using smoothed rank function","year":"2018","author":"esmaeili","key":"ref12"},{"key":"ref23","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Model Assisted Survey Sampling","year":"2003","author":"s\u00e4rndal","key":"ref15"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2290268"},{"key":"ref20","first-page":"35","article-title":"The netflix prize","volume":"2007","author":"bennett","year":"2007","journal-title":"Proceedings of KDD Cup and Workshop"},{"article-title":"Matrix co-completion for multi-label classification with missing features and labels","year":"2018","author":"xu","key":"ref11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"ref10","first-page":"757","article-title":"Transduction with matrix completion: Three birds with one stone","author":"goldberg","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref2","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015956706"},{"journal-title":"Sampling Statistics","year":"2011","author":"fuller","key":"ref16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1751-5823.2010.00099.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1198\/016214501750333054"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jeconom.2019.04.026"},{"key":"ref7","first-page":"1","article-title":"Collective matrix completion","volume":"20","author":"alaya","year":"2019","journal-title":"Journal of Machine Learning Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2019.1623041"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref3","article-title":"Matrix completion from noisy entries","volume":"22","author":"keshavan","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref6","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"cai","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref5","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"Journal of Machine Learning Research"}],"event":{"name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2023,6,4]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2023,6,10]]}},"container-title":["ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10094559\/10094560\/10096691.pdf?arnumber=10096691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T19:01:42Z","timestamp":1700506902000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10096691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,4]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/icassp49357.2023.10096691","relation":{},"subject":[],"published":{"date-parts":[[2023,6,4]]}}}