{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T07:16:29Z","timestamp":1787728589441,"version":"build-2784847793"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T00:00:00Z","timestamp":1387497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10115-013-0713-z","type":"journal-article","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T03:24:17Z","timestamp":1387423457000},"page":"525-544","source":"Crossref","is-referenced-by-count":133,"title":["Joint Schatten $$p$$ p -norm and $$\\ell _p$$ \u2113 p -norm robust matrix completion for missing value recovery"],"prefix":"10.1007","volume":"42","author":[{"given":"Feiping","family":"Nie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,20]]},"reference":[{"key":"713_CR1","first-page":"1329","volume":"17","author":"N Srebro","year":"2004","unstructured":"Srebro N, Rennie J, Jaakkola T (2004) Maximum margin matrix factorization. Conf Neural Inf Process Syst (NIPS) 17:1329\u20131336","journal-title":"Conf Neural Inf Process Syst (NIPS)"},{"key":"713_CR2","doi-asserted-by":"crossref","unstructured":"Rennie J, Srebro N (2005) Fast maximum margin matrix factorization for collaborative prediction. In: International conference on machine learning (ICML)","DOI":"10.1145\/1102351.1102441"},{"key":"713_CR3","first-page":"803","volume":"10","author":"J Abernethy","year":"2009","unstructured":"Abernethy J, Bach F, Evgeniou T, Vert JP (2009) A new approach to collaborative filtering: operator estimation with spectral regularization. J Mach Learn Res (JMLR) 10:803\u2013826","journal-title":"J Mach Learn Res (JMLR)"},{"issue":"6","key":"713_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s E, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9(6):717\u2013772","journal-title":"Found Comput Math"},{"issue":"5","key":"713_CR5","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Candes","year":"2009","unstructured":"Candes EJ, Tao T (2009) The power of convex relaxation: near-optimal matrix completion. IEEE Trans Inform Theory 56(5):2053\u20132080","journal-title":"IEEE Trans Inform Theory"},{"issue":"3","key":"713_CR6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht B, Fazel M, Parrilo PA (2010) Guaranteed minimum rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev 52(3):471\u2013501","journal-title":"SIAM Rev"},{"key":"713_CR7","unstructured":"Mazumder R, Hastie T, Tibshirani R (2010) Spectral regularization algorithms for learning large incomplete matrices. J Mach Learn Res (JMLR) 11:2287\u20132322"},{"issue":"4","key":"713_CR8","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2008","unstructured":"Cai J-F, Candes EJ, Shen Z (2008) A singular value thresholding algorithm for matrix completion. SIAM J Opt 20(4):1956\u20131982","journal-title":"SIAM J Opt"},{"key":"713_CR9","first-page":"615","volume":"6","author":"K Toh","year":"2010","unstructured":"Toh K, Yun S (2010) An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac J Opt 6:615\u2013640","journal-title":"Pac J Opt"},{"key":"713_CR10","doi-asserted-by":"crossref","unstructured":"Ji S, Ye Y (2009) An accelerated gradient method for trace norm minimization. In: International conference on machine learning (ICML)","DOI":"10.1145\/1553374.1553434"},{"key":"713_CR11","doi-asserted-by":"crossref","unstructured":"Liu Y-J, Sun D, Toh K-C (2012) An implementable proximal point algorithmic framework for nuclear norm minimization. Math Program 133(1\u20132):399\u2013436","DOI":"10.1007\/s10107-010-0437-8"},{"key":"713_CR12","doi-asserted-by":"crossref","unstructured":"Ma S, Goldfarb D, Chen L (2011) Fixed point and Bregman iterative methods for matrix rank minimization. Math Program 128(1\u20132):321\u2013353","DOI":"10.1007\/s10107-009-0306-5"},{"key":"713_CR13","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht B (2011) A simpler approach to matrix completion. J Mach Learn Res 12:3413\u20133430","journal-title":"J Mach Learn Res"},{"key":"713_CR14","doi-asserted-by":"crossref","unstructured":"Vishwanath S (2010) Information theoretic bounds for low-rank matrix completion. In: IEEE international symposium on information theory proceedings (ISIT), pp 1508\u20131512","DOI":"10.1109\/ISIT.2010.5513545"},{"key":"713_CR15","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii V, Lounici K, Tsybakov A (2011) Nuclear norm penalization and optimal rates for noisy low rank matrix completion. Ann Stat 39:2302\u20132329","journal-title":"Ann Stat"},{"key":"713_CR16","unstructured":"Salakhutdinov R, Srebro N (2010) Collaborative filtering in a non-uniform world: learning with the weighted trace norm. Adv Neural Inf Process Syst (NIPS) 23:1\u20138"},{"issue":"6","key":"713_CR17","doi-asserted-by":"crossref","first-page":"3465","DOI":"10.1137\/090763184","volume":"20","author":"TK Pong","year":"2010","unstructured":"Pong TK, Tseng P, Ji S, Ye J (2010) Trace norm regularization: reformulations, algorithms, and multi-task learning. SIAM J Opt 20(6):3465\u20133489","journal-title":"SIAM J Opt"},{"key":"713_CR18","unstructured":"Nie F, Wang H, Cai X, Huang H, Ding C (2012) Robust matrix completion via joint schatten $$p$$ p -norm and $$l_p$$ l p -norm minimization. In: IEEE international conference on data mining (ICDM), pp 566\u2013574"},{"key":"713_CR19","unstructured":"Huang J, Nie F, Huang H, Lei Y, Ding C (2013) Social trust prediction using rank-k matrix recovery. In: 23rd international joint conference on artificial intelligence"},{"key":"713_CR20","doi-asserted-by":"crossref","unstructured":"Huang J, Nie F, Huang H (2013) Robust discrete matrix completion. In: Twenty-seventh AAAI conference on artificial intelligence (AAAI-13), pp 424\u2013430","DOI":"10.1609\/aaai.v27i1.8675"},{"key":"713_CR21","doi-asserted-by":"crossref","unstructured":"Tan VY, Balzano L, Draper SC (2011) Rank minimization over finite fields. In: IEEE international symposium on information theory proceedings (ISIT), pp 1195\u20131199","DOI":"10.1109\/ISIT.2011.6033722"},{"key":"713_CR22","unstructured":"Meka R, Jain P, Dhillon IS (2010) Guaranteed rank minimization via singular value projection. In: Conference on neural information processing systems (NIPS)"},{"issue":"1","key":"713_CR23","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin EM (1985) Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1):3\u201316","journal-title":"Problemy Peredachi Informatsii"},{"key":"713_CR24","unstructured":"Loidreau P (2008) Properties of codes in rank metric. In: Eleventh international workshop on algebraic and combinatorial coding theory, pp 192\u2013198"},{"key":"713_CR25","doi-asserted-by":"crossref","first-page":"4734","DOI":"10.1109\/ACC.2001.945730","volume":"6","author":"M Fazel","year":"2001","unstructured":"Fazel M, Hindi H, Boyd SP (2001) A rank minimization heuristic with application to minimum order system approximation. IEEE Am Control Conf 6:4734\u20134739","journal-title":"IEEE Am Control Conf"},{"key":"713_CR26","first-page":"2156","volume":"3","author":"M Fazel","year":"2003","unstructured":"Fazel M, Hindi H, Boyd SP (2003) Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. IEEE Am Control Conf 3:2156\u20132162","journal-title":"IEEE Am Control Conf"},{"issue":"4","key":"713_CR27","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","volume":"10","author":"J Blomer","year":"1997","unstructured":"Blomer J, Karp R, Welzl E (1997) The rank of sparse random matrices over finite fields. Random Struct Algorithms 10(4):407\u2013420","journal-title":"Random Struct Algorithms"},{"issue":"1\u20132","key":"713_CR28","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma S, Goldfarb D, Chen L (2011) Fixed point and Bregman iterative methods for matrix rank minimization. Math Program 128(1\u20132):321\u2013353","journal-title":"Math Program"},{"key":"713_CR29","unstructured":"Nie F, Huang H, Ding CHQ (2012) Low-rank matrix recovery via efficient schatten p-norm minimization. In: AAAI conference on artificial intelligence"},{"key":"713_CR30","unstructured":"Nie F, Huang H, Cai X, Ding C (2010) Efficient and robust feature selection via joint $$\\ell _{2,1}$$ \u2113 2 , 1 -norms minimization. In: Conference on neural information processing systems (NIPS)"},{"key":"713_CR31","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell MJD (1969) A method for nonlinear constraints in minimization problems. In: Fletcher R (ed) Optimization. Academic Press, London"},{"key":"713_CR32","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes MR (1969) Multiplier and gradient methods. J Opt Theory Appl 4:303\u2013320","journal-title":"J Opt Theory Appl"},{"key":"713_CR33","volume-title":"Constrained optimization and lagrange multiplier methods","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas DP (1996) Constrained optimization and lagrange multiplier methods. Athena Scientific, Belmont"},{"issue":"1","key":"713_CR34","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1969","unstructured":"Gabay D, Mercier B (1969) A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput Math Appl 2(1):17\u201340","journal-title":"Comput Math Appl"},{"key":"713_CR35","unstructured":"Wright J, Ganesh A, Rao S, Ma Y (2009) Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization. In: The proceedings of the conference on neural information processing systems. pp 1\u20139"},{"issue":"6","key":"713_CR36","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E Candes","year":"2010","unstructured":"Candes E, Plan Y (2010) Matrix completion with noise. Proc IEEE 98(6):925\u2013936","journal-title":"Proc IEEE"},{"key":"713_CR37","first-page":"1257","volume":"20","author":"R Salakhutdinov","year":"2008","unstructured":"Salakhutdinov R, Mnih A (2008) Probabilistic matrix factorization. Adv Neural Inf Process Syst (NIPS) 20:1257\u20131264","journal-title":"Adv Neural Inf Process Syst (NIPS)"},{"key":"713_CR38","doi-asserted-by":"crossref","unstructured":"Gu Q, Zhou J, Ding C (2010) Collaborative filtering: weighted nonnegative matrix factorization incorporating user and item graphs. In: Siam data mining conference","DOI":"10.1137\/1.9781611972801.18"},{"key":"713_CR39","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: International world wide web conference (WWW). ACM, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"issue":"1","key":"713_CR40","first-page":"29","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang K, Dasgupta A, Mahoney M (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Int Math 6(1):29\u2013123","journal-title":"Int Math"},{"issue":"2","key":"713_CR41","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"M Newman","year":"2001","unstructured":"Newman M (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102","journal-title":"Phys Rev E"},{"key":"713_CR42","unstructured":"Billsus D, Pazzani M (1998) Learning collaborative information filters. In: International conference on machine learning (ICML), pp 46\u201354"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0713-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0713-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0713-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T05:40:52Z","timestamp":1688881252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0713-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,20]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["713"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0713-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,20]]}}}