{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T01:57:36Z","timestamp":1762999056158,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T00:00:00Z","timestamp":1396828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google, Amazon, an IBM Faculty Award, a Google Focused Research Award"},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CNS-1314632, IIS-0953330, IIS-0916345, IIS-0911032"],"award-info":[{"award-number":["CNS-1314632, IIS-0953330, IIS-0916345, IIS-0911032"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1314632, IIS-0953330, IIS-0916345, IIS-0911032"],"award-info":[{"award-number":["CNS-1314632, IIS-0953330, IIS-0916345, IIS-0911032"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000082","name":"Division of Graduate Education","doi-asserted-by":"publisher","award":["DGE-1252522"],"award-info":[{"award-number":["DGE-1252522"]}],"id":[{"id":"10.13039\/100000082","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,4,7]]},"DOI":"10.1145\/2566486.2568040","type":"proceedings-article","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T12:57:59Z","timestamp":1412686679000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["CoBaFi"],"prefix":"10.1145","author":[{"given":"Alex","family":"Beutel","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Kenton","family":"Murray","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Alexander J.","family":"Smola","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,4,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281199"},{"key":"e_1_3_2_1_2_1","volume-title":"WWW","author":"Ahmed A.","year":"2013","unstructured":"A. Ahmed , N. Shervashidze , S. Narayanamurthy , V. Josifovski , and A. J. Smola . Distributed large-scale natural graph factorization . In WWW , 2013 . A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, and A. J. Smola. Distributed large-scale natural graph factorization. In WWW, 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(81)90099-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376945"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020281327116"},{"key":"e_1_3_2_1_7_1","volume-title":"NIPS 19","author":"Burges C. J.","year":"2007","unstructured":"C. J. Burges , Q. V. Le , and R. Ragno . Learning to rank with nonsmooth cost functions. In B. Scholkopf, J. Platt, and T. Hofmann, eds ., NIPS 19 , 2007 . C. J. Burges, Q. V. Le, and R. Ragno. Learning to rank with nonsmooth cost functions. In B. Scholkopf, J. Platt, and T. Hofmann, eds., NIPS 19, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_2_1_9_1","volume-title":"Graph limits and exchangeable random graphs","author":"Diaconis P.","year":"2007","unstructured":"P. Diaconis and S. Janson . Graph limits and exchangeable random graphs , 2007 . arXiv:0712.2749. P. Diaconis and S. Janson. Graph limits and exchangeable random graphs, 2007. arXiv:0712.2749."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"e_1_3_2_1_11_1","unstructured":"T. Haines. Gaussian conjugate prior cheat sheet. http:\/\/thaines.com\/content\/misc\/gaussian_conjugate_prior_cheat_sheet.pdf 2011.  T. Haines. Gaussian conjugate prior cheat sheet. http:\/\/thaines.com\/content\/misc\/gaussian_conjugate_prior_cheat_sheet.pdf 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102389"},{"key":"e_1_3_2_1_13_1","volume-title":"NIPS","author":"Herbrich R.","year":"2007","unstructured":"R. Herbrich , T. Minka , and T. Graepel . Trueskill TM: A Bayesian skill ranking system . In NIPS , 2007 . R. Herbrich, T. Minka, and T. Graepel. Trueskill TM: A Bayesian skill ranking system. In NIPS, 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"The no-u-turn sampler: Adaptively setting path lengths in hamiltonian monte carlo. Technical report, arXiv","author":"Hoffman M. D.","year":"2011","unstructured":"M. D. Hoffman and A. Gelman . The no-u-turn sampler: Adaptively setting path lengths in hamiltonian monte carlo. Technical report, arXiv , 2011 . http:\/\/arxiv.org\/abs\/1111.4246. M. D. Hoffman and A. Gelman. The no-u-turn sampler: Adaptively setting path lengths in hamiltonian monte carlo. Technical report, arXiv, 2011. http:\/\/arxiv.org\/abs\/1111.4246."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187940"},{"key":"e_1_3_2_1_16_1","volume-title":"Relations on probability spaces and arrays of random variables","author":"Hoover D.N.","year":"1979","unstructured":"D.N. Hoover . Relations on probability spaces and arrays of random variables . Institute of Advanced Studies , Princeton, NJ , 1979 . D.N. Hoover. Relations on probability spaces and arrays of random variables. Institute of Advanced Studies, Princeton, NJ, 1979."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341560"},{"key":"e_1_3_2_1_18_1","volume-title":"Probabilistic symmetries and invariance principles","author":"Kallenberg O.","year":"2005","unstructured":"O. Kallenberg . Probabilistic symmetries and invariance principles . Springer , 2005 . O. Kallenberg. Probabilistic symmetries and invariance principles. Springer, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_21_1","volume-title":"Algorithms for non-negative matrix factorization","author":"Lee D.","year":"2001","unstructured":"D. Lee and H. Seung . Algorithms for non-negative matrix factorization . In T. K. Leen, T. G. Dietterich, and V. Tresp, eds., NIPS 13. MIT Press , 2001 . D. Lee and H. Seung. Algorithms for non-negative matrix factorization. In T. K. Leen, T. G. Dietterich, and V. Tresp, eds., NIPS 13. MIT Press, 2001."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871557"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.110"},{"key":"e_1_3_2_1_25_1","volume-title":"Machine learning: a probabilistic perspective","author":"Murphy P.","year":"2012","unstructured":"Kevin P. Murphy . Machine learning: a probabilistic perspective . MIT Press , 2012 . Kevin P. Murphy. Machine learning: a probabilistic perspective. MIT Press, 2012."},{"key":"e_1_3_2_1_26_1","volume-title":"Markov chain sampling methods for dirichlet process mixture models. TR-9815","author":"Neal R.","year":"1998","unstructured":"R. Neal . Markov chain sampling methods for dirichlet process mixture models. TR-9815 , U. Toronto , 1998 . R. Neal. Markov chain sampling methods for dirichlet process mixture models. TR-9815, U. Toronto, 1998."},{"key":"e_1_3_2_1_27_1","volume-title":"ICML","author":"Palla K.","year":"2012","unstructured":"K. Palla , D. A. Knowles , and Z. Ghahramani . An infinite latent attribute model for network data . In ICML , 2012 . K. Palla, D. A. Knowles, and Z. Ghahramani. An infinite latent attribute model for network data. In ICML, 2012."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1024404422"},{"key":"e_1_3_2_1_29_1","volume-title":"Multi-HDP: A non parametric bayesian model for tensor factorization","author":"Porteous I.","year":"2008","unstructured":"I. Porteous , E. Bart , and M. Welling . Multi-HDP: A non parametric bayesian model for tensor factorization . In D. Fox and C.P. Gomes, eds., AAAI, pg. 1487--1490. AAAI Press , 2008 . I. Porteous, E. Bart, and M. Welling. Multi-HDP: A non parametric bayesian model for tensor factorization. In D. Fox and C.P. Gomes, eds., AAAI, pg. 1487--1490. AAAI Press, 2008."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718498"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639742"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390267"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-BA625"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/3121525.3121550"},{"key":"e_1_3_2_1_36_1","volume-title":"Generalization error bounds for collaborative prediction with low-rank matrices","author":"Srebro N.","year":"2005","unstructured":"N. Srebro , N. Alon , and T. Jaakkola . Generalization error bounds for collaborative prediction with low-rank matrices . In L. K. Saul, Y. Weiss, and L. Bottou, editors, NIPS 17, 2005 . MIT Press . N. Srebro, N. Alon, and T. Jaakkola. Generalization error bounds for collaborative prediction with low-rank matrices. In L. K. Saul, Y. Weiss, and L. Bottou, editors, NIPS 17, 2005. MIT Press."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505712"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553513"},{"key":"e_1_3_2_1_39_1","volume-title":"NIPS 20","author":"Weimer M.","year":"2008","unstructured":"M. Weimer , A. Karatzoglou , Q. Le , and A. J. Smola . Cofi rank - maximum margin matrix factorization for collaborative ranking . In NIPS 20 , 2008 . M. Weimer, A. Karatzoglou, Q. Le, and A. J. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In NIPS 20, 2008."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283696.2283856"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009959"},{"key":"e_1_3_2_1_42_1","volume-title":"NIPS 20, pg. 1697--1704","author":"Zheng Z.","year":"2008","unstructured":"Z. Zheng , H. Zha , T. Zhang , O. Chapelle , K. Chen , and G. Sun . A general boosting method and its application to learning ranking functions for web search . In NIPS 20, pg. 1697--1704 . MIT Press , 2008 . Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In NIPS 20, pg. 1697--1704. MIT Press, 2008."}],"event":{"name":"WWW '14: 23rd International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Korea","acronym":"WWW '14"},"container-title":["Proceedings of the 23rd international conference on World wide web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2566486.2568040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2566486.2568040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:00Z","timestamp":1750230060000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2566486.2568040"}},"subtitle":["collaborative bayesian filtering"],"short-title":[],"issued":{"date-parts":[[2014,4,7]]},"references-count":42,"alternative-id":["10.1145\/2566486.2568040","10.1145\/2566486"],"URL":"https:\/\/doi.org\/10.1145\/2566486.2568040","relation":{},"subject":[],"published":{"date-parts":[[2014,4,7]]},"assertion":[{"value":"2014-04-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}