{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:56:18Z","timestamp":1730195778335,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262792","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"604-611","source":"Crossref","is-referenced-by-count":5,"title":["An approximation of the CP-rank of a partially sampled tensor"],"prefix":"10.1109","author":[{"given":"Morteza","family":"Ashraphijuo","sequence":"first","affiliation":[]},{"given":"Xiaodong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Rank determination for low-rank data completion","year":"2017","author":"ashraphijuo","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541268"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006708"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006584"},{"journal-title":"Matrix completion using nuclear norm spectral norm or weighted nuclear norm minimization","year":"2015","author":"shabat","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/097"},{"key":"ref34","first-page":"1391","article-title":"The algebraic combinatorial approach for low-rank matrix completion","volume":"16","author":"kir\u00e1ly","year":"2015","journal-title":"Journal of Machine Learning Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2505729"},{"journal-title":"Supplemental material for reverse engineering gene regulatory networks from measurement with missing values","year":"0","author":"ogundijo","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799276"},{"journal-title":"Scaled nuclear norm minimization for low-rank tensor completion","year":"2017","author":"ashraphijuo","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7403257"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref4","first-page":"489","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"ACM-SIAM Symp on Discrete Algorithms"},{"journal-title":"Deterministic and probabilistic conditions for finite completability of low rank tensor","year":"2016","author":"ashraphijuo","key":"ref28"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718867"},{"key":"ref27","first-page":"1","article-title":"Fundamental conditions for low-cp-rank tensor completion","volume":"18","author":"ashraphijuo","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2210872"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.crme.2010.06.005"},{"journal-title":"Characterization of deterministic and probabilistic sampling patterns for finite completability of low tensor-train rank tensor","year":"2017","author":"ashraphijuo","key":"ref29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1186\/s13637-016-0055-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/110848074"},{"journal-title":"Matrix completion has no spurious local minimum","year":"2016","author":"ge","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282844"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852389"},{"key":"ref24","article-title":"The information-theoretic requirements of subspace clustering with missing data","author":"pimentel-alarc\u00f3n","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2016.7551734"},{"journal-title":"Deterministic and probabilistic conditions for finite completability of low-rank multi-view data","year":"2017","author":"ashraphijuo","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2537145"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262792.pdf?arnumber=8262792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T21:31:50Z","timestamp":1519853510000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262792","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}