{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T16:25:47Z","timestamp":1770481547153,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,23]],"date-time":"2008-10-23T00:00:00Z","timestamp":1224720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,10,23]]},"DOI":"10.1145\/1454008.1454049","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"267-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":100,"title":["Matrix factorization and neighbor based algorithms for the netflix prize problem"],"prefix":"10.1145","author":[{"given":"G\u00e1bor","family":"Tak\u00e1cs","sequence":"first","affiliation":[{"name":"Sz\u00e9chenyi Istv\u00e1n University, Gy\u0151r, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Istv\u00e1n","family":"Pil\u00e1szy","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Botty\u00e1n","family":"N\u00e9meth","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budpest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domonkos","family":"Tikk","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.90"},{"key":"e_1_3_2_1_2_1","volume-title":"AT&T Labs Research","author":"Bell R. M.","year":"2007","unstructured":"R. M. Bell , Y. Koren , and C. Volinsky . The BellKor solution to the Net Flix Prize. Technical report , AT&T Labs Research , 2007 . http:\/\/www.netflixprize.com\/assets\/ProgressPrize2007_KorBell.pdf. R. M. Bell, Y. Koren, and C. Volinsky. The BellKor solution to the Net Flix Prize. Technical report, AT&T Labs Research, 2007. http:\/\/www.netflixprize.com\/assets\/ProgressPrize2007_KorBell.pdf."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345459"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of KDD Cup Workshop at SIGKDD'07","author":"Bennett J.","year":"2007","unstructured":"J. Bennett and S. Lanning . The Net Flix Prize . In Proc. of KDD Cup Workshop at SIGKDD'07 , 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 3--6, San Jose, CA, USA , 2007 . J. Bennett and S. Lanning. The Net Flix Prize. In Proc. of KDD Cup Workshop at SIGKDD'07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 3--6, San Jose, CA, USA, 2007."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of UAI'98","author":"Breese J. S.","year":"1998","unstructured":"J. S. Breese , D. Heckerman , and C. Kadie . Empirical analysis of predictive algorithms for collaborative filtering . In Proc. of UAI'98 , 14th Conference on Uncertainty in Artificial Intelligence, pages 43--52. Morgan-Kaufmann , 1998 . J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. of UAI'98, 14th Conference on Uncertainty in Artificial Intelligence, pages 43--52. Morgan-Kaufmann, 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564419"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963774"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of KDD Cup Workshop at SIGKDD'07","author":"Paterek A.","year":"2007","unstructured":"A. Paterek . Improving regularized singular value decomposition for collaborative filtering . In Proc. of KDD Cup Workshop at SIGKDD'07 , 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 39--42, San Jose, CA, USA , 2007 . A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In Proc. of KDD Cup Workshop at SIGKDD'07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 39--42, San Jose, CA, USA, 2007."},{"key":"e_1_3_2_1_10_1","first-page":"473","volume-title":"Proc. of UAI'00: 16th Conf. on Uncertainty in Artificial Intelligence","author":"Pennock D. M.","year":"2000","unstructured":"D. M. Pennock , E. Horvitz , S. Lawrence , and C. L. Giles . Collaborative filtering by personality diagnosis: A hybrid memory and model-based approach . In Proc. of UAI'00: 16th Conf. on Uncertainty in Artificial Intelligence , pages 473 -- 480 , Stanford, CA, USA , 2000 . Morgan Kaufmann. D. M. Pennock, E. Horvitz, S. Lawrence, and C. L. Giles. Collaborative filtering by personality diagnosis: A hybrid memory and model-based approach. In Proc. of UAI'00: 16th Conf. on Uncertainty in Artificial Intelligence, pages 473--480, Stanford, CA, USA, 2000. Morgan Kaufmann."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of WebKDD'06: KDD Workshop on Web Mining and Web Usage Analysis, at 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Rashid A. M.","year":"2006","unstructured":"A. M. Rashid , S. K. Lam , G. Karypis , and J. Riedl . ClustKNN: a highly scalable hybrid model-& memory-based CF algorithm . In Proc. of WebKDD'06: KDD Workshop on Web Mining and Web Usage Analysis, at 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining , Philadelphia, PA, USA , 2006 . A. M. Rashid, S. K. Lam, G. Karypis, and J. Riedl. ClustKNN: a highly scalable hybrid model-& memory-based CF algorithm. In Proc. of WebKDD'06: KDD Workshop on Web Mining and Web Usage Analysis, at 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/192844.192905"},{"key":"e_1_3_2_1_13_1","volume-title":"Advances in Neural Information Processing Systems 20","author":"Salakhutdinov R.","year":"2008","unstructured":"R. Salakhutdinov and A. Mnih . Probabilistic matrix factorization . In J. C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20 , Cambridge, MA , 2008 . MIT Press . R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In J. C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, Cambridge, MA, 2008. MIT Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273596"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA439541"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_1_17_1","first-page":"17","article-title":"Maximum-margin matrix factorization","author":"Srebro N.","year":"2005","unstructured":"N. Srebro , J. D. M. Rennie , and T. S. Jaakkola . Maximum-margin matrix factorization . Advances in Neural Information Processing Systems , 17 , 2005 . N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. Advances in Neural Information Processing Systems, 17, 2005.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of KDD Cup Workshop at SIGKDD'07","author":"Tak\u00e1cs G.","year":"2007","unstructured":"G. Tak\u00e1cs , I. Pil\u00e1szy , B. N\u00e9meth , and D. Tikk . On the Gravity recommendation system . In Proc. of KDD Cup Workshop at SIGKDD'07 , 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 22--30, San Jose, CA, USA , 2007 . G. Tak\u00e1cs, I. Pil\u00e1szy, B. N\u00e9meth, and D. Tikk. On the Gravity recommendation system. In Proc. of KDD Cup Workshop at SIGKDD'07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 22--30, San Jose, CA, USA, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.036"}],"event":{"name":"RecSys08: ACM Conference on Recommender Systems","location":"Lausanne Switzerland","acronym":"RecSys08","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval","SIGCHI ACM Special Interest Group on Computer-Human Interaction"]},"container-title":["Proceedings of the 2008 ACM conference on Recommender systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454008.1454049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1454008.1454049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:39Z","timestamp":1750253379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454008.1454049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,23]]},"references-count":19,"alternative-id":["10.1145\/1454008.1454049","10.1145\/1454008"],"URL":"https:\/\/doi.org\/10.1145\/1454008.1454049","relation":{},"subject":[],"published":{"date-parts":[[2008,10,23]]},"assertion":[{"value":"2008-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}