{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T13:13:54Z","timestamp":1723554834190},"reference-count":37,"publisher":"Institution of Engineering and Technology (IET)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603192","61772277"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M611656"],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005271","name":"Nanjing University of Science and Technology","doi-asserted-by":"publisher","award":["30916014107"],"id":[{"id":"10.13039\/501100005271","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IET Image Processing"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1049\/iet-ipr.2017.0515","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T15:23:50Z","timestamp":1516634630000},"page":"959-966","source":"Crossref","is-referenced-by-count":13,"title":["Matrix completion via capped nuclear norm"],"prefix":"10.1049","volume":"12","author":[{"given":"Fanlong","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Technology, Nanjing Audit UniversityNanjingPeople's Republic of China"}]},{"given":"Zhangjing","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Technology, Nanjing Audit UniversityNanjingPeople's Republic of China"}]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and TechnologyNanjing University of Science and TechnologyNanjingPeople's Republic of China"}]},{"given":"Jian","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and TechnologyNanjing University of Science and TechnologyNanjingPeople's Republic of China"}]},{"given":"Guowei","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Technology, Nanjing Audit UniversityNanjingPeople's Republic of China"}]}],"member":"265","published-online":{"date-parts":[[2018,6]]},"reference":[{"key":"e_1_2_7_2_1","unstructured":"2005 Proc. Int. Conf. of Machine Learning J. Rennie N. Srebro Fast maximum margin matrix factorization for collaborative prediction 713 719"},{"issue":"8","key":"e_1_2_7_3_1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix factorization techniques for recommender systems","volume":"42","author":"Yehuda K.","year":"2009","journal-title":"Computer"},{"issue":"1","key":"e_1_2_7_4_1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s11263-005-4939-z","article-title":"Unsupervised learning of image manifolds by semidefinite programming","volume":"70","author":"Kilian Q.","year":"2006","journal-title":"Int. J. Comput. Vis."},{"issue":"9","key":"e_1_2_7_5_1","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","article-title":"Fast and accurate matrix completion via truncated nuclear norm regularization","volume":"35","author":"Hu Y.","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"e_1_2_7_7_1","unstructured":"2001 Proc. American Control Conf. M. Fazel H. Hindi S. Boyd A rank minimization heuristic with application to minimum order system approximation 4734 4739"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-spr.2015.0420"},{"key":"e_1_2_7_11_1","first-page":"1329","volume-title":"Advances in neural information processing systems","author":"Srebro N.","year":"2004"},{"key":"e_1_2_7_12_1","unstructured":"2011 JMLR: Workshop and Conf. Proc. R. Foygel N. Srebro Concentration\u2010based guarantees for low\u2010rank matrix reconstruction 315 339"},{"key":"e_1_2_7_13_1","unstructured":"CaiT.T. andZhouW.: \u2018Matrix completion via max\u2010norm constrained optimization\u2019 2013 arXiv:1303.0341"},{"key":"e_1_2_7_14_1","unstructured":"2016 22nd ACM SIGKDD Conf. on Knowledge Discovery and Data Mining Z. Huo F. Nie H. Huang Robust and effective metric learning using capped trace norm 1605 1614"},{"key":"e_1_2_7_15_1","unstructured":"2013 Proc. 19th ACM SIGKDD Q. Sun S. Xiang J. Ye Robust principal component analysis via capped norms 311 319"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0713-z"},{"key":"e_1_2_7_17_1","doi-asserted-by":"crossref","unstructured":"2013 ECML PKDD 2013 Part II LNAI 8189 D. Liu T. Zhou H. Qian A nearly unbiased matrix completion approach 210 225","DOI":"10.1007\/978-3-642-40991-2_14"},{"key":"e_1_2_7_18_1","doi-asserted-by":"crossref","unstructured":"YaoQ. andKwokJ.T.: \u2018Fast learning with nonconvexl1\u20132regularization\u2019 2016 arXiv:1610.09461v2","DOI":"10.1155\/2016\/5065217"},{"issue":"1","key":"e_1_2_7_19_1","first-page":"289","article-title":"Convex analysis approach to dc programming: theory, algorithms and applications","volume":"22","author":"Tao P.","year":"1997","journal-title":"Acta Math. Vietnam."},{"issue":"3","key":"e_1_2_7_20_1","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1007\/s10915-016-0175-z","article-title":"Variational multiplicative noise removal by DC programming","volume":"68","author":"Li Z.","year":"2016","journal-title":"J. Sci. Comput."},{"key":"e_1_2_7_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"issue":"1","key":"e_1_2_7_22_1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","article-title":"Fixed point and Bregman iterative methods for matrix rank minimization","volume":"128","author":"Ma S.","year":"2011","journal-title":"Math. Program."},{"key":"e_1_2_7_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/100811404"},{"key":"e_1_2_7_24_1","unstructured":"2011 Advances in Neural Information Processing Systems Z. Lin R. Liu Z. Su Linearized alternating direction method with adaptive penalty for low\u2010rank representation 612 620"},{"issue":"3","key":"e_1_2_7_25_1","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"Toh K.C.","year":"2010","journal-title":"Pacific J. Optim."},{"key":"e_1_2_7_26_1","unstructured":"2009 Proc. 26th Int. Conf. on Machine Learning S. Ji J. Ye An accelerated gradient method for trace norm minimization 457 464"},{"key":"e_1_2_7_27_1","unstructured":"2012 Proc. 18th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining Y. Hu D. Zhang J. Liu Accelerated singular value thresholding for matrix completion 298 306"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"e_1_2_7_29_1","unstructured":"2014 Int. Conf. on Machine Learning C.\u2010J. Hsieh P.A. Olsen Nuclear norm minimization via active subspace selection 575 583"},{"key":"e_1_2_7_30_1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.neucom.2015.10.052","article-title":"Online robust principal component analysis via truncated nuclear norm regularization","volume":"175","author":"Hong B.","year":"2016","journal-title":"Neurocomputing"},{"issue":"2","key":"e_1_2_7_31_1","doi-asserted-by":"crossref","first-page":"i60","DOI":"10.1093\/bioinformatics\/btu269","article-title":"Inductive matrix completion for predicting gene\u2010disease associations","volume":"30","author":"Natarajan N.","year":"2014","journal-title":"Bioinformatics"},{"issue":"1","key":"e_1_2_7_32_1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2016.07.014","article-title":"Matrix completion under interval uncertainty","volume":"256","author":"Mare\u010dek J.","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"e_1_2_7_33_1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/imanum\/drt056","article-title":"Correlation matrix nearness and completion under observation uncertainty","volume":"35","author":"Ala\u00edz C.M.","year":"2015","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"e_1_2_7_34_1","first-page":"1","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd S.","year":"2010","journal-title":"Inf. Syst."},{"key":"e_1_2_7_35_1","unstructured":"2014 IEEE Int. Conf. on Computer Vision and Pattern Recognition C.\u2010Y. Lu J.H. Tang S.C. Yan Generalized nonconvex nonsmooth low\u2010rank minimization 4130 4137"},{"key":"e_1_2_7_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.161"},{"key":"e_1_2_7_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"},{"key":"e_1_2_7_38_1","unstructured":"1999 SIGIR \u201899: Proc. 22nd Annual Int. ACM SIGIR Conf. on Research and Development in Information Retrieval J. Herlocker J. Konstan A. Borchers An algorithmic framework for performing collaborative filtering 230 237"}],"container-title":["IET Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-ipr.2017.0515","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/iet-ipr.2017.0515","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-ipr.2017.0515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T03:35:55Z","timestamp":1610595355000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1049\/iet-ipr.2017.0515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["10.1049\/iet-ipr.2017.0515"],"URL":"https:\/\/doi.org\/10.1049\/iet-ipr.2017.0515","archive":["Portico"],"relation":{},"ISSN":["1751-9667","1751-9667"],"issn-type":[{"value":"1751-9667","type":"print"},{"value":"1751-9667","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}