{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T09:54:57Z","timestamp":1672480497887},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,8,8]],"date-time":"2014-08-08T00:00:00Z","timestamp":1407456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10994-014-5454-z","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T10:35:12Z","timestamp":1407407712000},"page":"177-203","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Collaborative filtering with information-rich and\u00a0information-sparse entities"],"prefix":"10.1007","volume":"97","author":[{"given":"Kai","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Srikant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,8]]},"reference":[{"key":"5454_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-02247-0_24","volume-title":"User modeling, adaptation, and personalization","author":"X Amatriain","year":"2009","unstructured":"Amatriain, X., Pujol, J. M., & Oliver, N. (2009). I like it.. i like it not: Evaluating user ratings noise in recommender systems. User modeling, adaptation, and personalization (pp. 247\u2013258). Berlin: Springer."},{"key":"5454_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Hegde, N., & Massouli\u00e9, L. (2012). The price of privacy in untrusted recommendation engines. In The 50th Annual Allerton Conference on Communication, Control, and Computing, pp 920\u2013927.","DOI":"10.1109\/Allerton.2012.6483317"},{"issue":"12","key":"5454_CR3","doi-asserted-by":"crossref","first-page":"7110","DOI":"10.1109\/TIT.2012.2216980","volume":"58","author":"K Barman","year":"2012","unstructured":"Barman, K., & Dabeer, O. (2012). Analysis of a collaborative filter based on popularity amongst neighbors. IEEE Transactions on Information Theory, 58(12), 7110\u20137134.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5454_CR4","unstructured":"Boyd, S., Cortes, C., Mohri, M., & Radovanovic, A. (2012). Accuracy at the top. In F. Pereira, C. J. C. Burges, L. Bottou & K. Q. Weinberger (Eds.), Advances in neural information processing systems (pp. 962\u2013970). Lake Tahoe, Neveda: Curran Associates, Inc."},{"issue":"4","key":"5454_CR5","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J. F., Cand\u00e8s, E. J., & Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956\u20131982.","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"5454_CR6","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"5454_CR7","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E. J., & Tao, T. (2010). The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5), 2053\u20132080.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"5454_CR8","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D. (2011). Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory, 57(3), 1548\u20131566.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5454_CR9","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., & Sanghavi, S. (2013). Low-rank matrix completion using alternating minimization. In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, pp 665\u2013674.","DOI":"10.1145\/2488608.2488693"},{"key":"5454_CR10","first-page":"2057","volume":"99","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R. H., Montanari, A., & Oh, S. (2010). Matrix completion from noisy entries. The Journal of Machine Learning Research, 99, 2057\u20132078.","journal-title":"The Journal of Machine Learning Research"},{"key":"5454_CR11","doi-asserted-by":"crossref","unstructured":"Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., & Riedl, J. (1997). GroupLens: Applying collaborative filtering to usenet news. ACM Communications, 40(3), 77\u201387.","DOI":"10.1145\/245108.245126"},{"key":"5454_CR12","doi-asserted-by":"crossref","unstructured":"Koren, Y., Bell, R., & Volinsky, C. (2009). Matrix factorization techniques for recommender systems. Computer, 42(8), 30\u201337.","DOI":"10.1109\/MC.2009.263"},{"key":"5454_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., & Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press."},{"key":"5454_CR14","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B. (2011). A simpler approach to matrix completion. The Journal of Machine Learning Research, 12, 3413\u20133430.","journal-title":"The Journal of Machine Learning Research"},{"key":"5454_CR15","doi-asserted-by":"crossref","unstructured":"Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994). GroupLens: An open architecture for collaborative filtering of netnews. In Proceedings of ACM Conference on Computer Supported Cooperative Work, New York, NY, pp. 175\u2013186.","DOI":"10.1145\/192844.192905"},{"key":"5454_CR16","unstructured":"Shen, Y., Wen, Z., & Zhang, Y. (2012). Augmented lagrangian alternating direction method for matrix separation based on low-rank factorization. Optimization Methods and Software, 29, 1\u201325."},{"key":"5454_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/11-SSY036","volume":"4","author":"DC Tomozei","year":"2014","unstructured":"Tomozei, D. C., & Massouli\u00e9, L. (2014). Distributed user profiling via spectral methods. Stochastic Systems, 4, 1\u201343. doi: 10.1214\/11-SSY036 .","journal-title":"Stochastic Systems"},{"key":"5454_CR18","unstructured":"Xu, J., Wu, R., Zhu, K., Hajek, B., Srikant, R., & Ying, L. (2013). Exact block-constant rating matrix recovery from a few noisy observations. arXiv:1310.0512 ."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5454-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-014-5454-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5454-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:38Z","timestamp":1559338838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-014-5454-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,8]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["5454"],"URL":"https:\/\/doi.org\/10.1007\/s10994-014-5454-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,8]]}}}