{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:08:19Z","timestamp":1775815699359,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"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,8,24]]},"DOI":"10.1145\/1401890.1401969","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"650-658","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":711,"title":["Relational learning via collective matrix factorization"],"prefix":"10.1145","author":[{"given":"Ajit P.","family":"Singh","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Geoffrey J.","family":"Gordon","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"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","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(81)90099-3"},{"key":"e_1_3_2_1_3_1","volume-title":"Exchangeability and related topics","author":"Aldous D. J.","year":"1985","unstructured":"D. J. Aldous . Exchangeability and related topics , chapter 1. Springer , 1985 . D. J. Aldous. Exchangeability and related topics, chapter 1. Springer, 1985."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010896012157"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.14"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194902"},{"key":"e_1_3_2_1_7_1","volume-title":"Online Learning and Neural Networks","author":"Bottou L.","year":"1998","unstructured":"L. Bottou . Online algorithms and stochastic approximations . In Online Learning and Neural Networks . Cambridge UP , 1998 . L. Bottou. Online algorithms and stochastic approximations. In Online Learning and Neural Networks. Cambridge UP, 1998."},{"key":"e_1_3_2_1_8_1","volume-title":"NIPS","author":"Bottou L.","year":"2003","unstructured":"L. Bottou and Y. LeCun . Large scale online learning . In NIPS , 2003 . L. Bottou and Y. LeCun. Large scale online learning. In NIPS, 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"e_1_3_2_1_11_1","volume-title":"Oxford UP","author":"Censor Y.","year":"1997","unstructured":"Y. Censor and S. A. Zenios . Parallel Optimization: Theory, Algorithms, and Applications . Oxford UP , 1997 . Y. Censor and S. A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford UP, 1997."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/320434.320440"},{"key":"e_1_3_2_1_13_1","volume-title":"NIPS","author":"Cohn D.","year":"2000","unstructured":"D. Cohn and T. Hofmann . The missing link-a probabilistic model of document content and hypertext connectivity . In NIPS , 2000 . D. Cohn and T. Hofmann. The missing link-a probabilistic model of document content and hypertext connectivity. In NIPS, 2000."},{"key":"e_1_3_2_1_14_1","volume-title":"NIPS","author":"Collins M.","year":"2001","unstructured":"M. Collins , S. Dasgupta , and R. E. Schapire . A generalization of principal component analysis to the exponential family . In NIPS , 2001 . M. Collins, S. Dasgupta, and R. E. Schapire. A generalization of principal component analysis to the exponential family. In NIPS, 2001."},{"key":"e_1_3_2_1_15_1","first-page":"90","volume-title":"COLT","author":"Forster J.","year":"2000","unstructured":"J. Forster and M. K. Warmuth . Relative expected instantaneous loss bounds . In COLT , pages 90 -- 99 , 2000 . J. Forster and M. K. Warmuth. Relative expected instantaneous loss bounds. In COLT, pages 90--99, 2000."},{"key":"e_1_3_2_1_16_1","volume-title":"Matrix Computions. John Hopkins UP","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. V. Loan . Matrix Computions. John Hopkins UP , 3 rd edition, 1996 . G. H. Golub and C. F. V. Loan. Matrix Computions. John Hopkins UP, 3rd edition, 1996.","edition":"3"},{"key":"e_1_3_2_1_17_1","volume-title":"NIPS","author":"Gordon G. J.","year":"2002","unstructured":"G. J. Gordon . Generalized2 linear2 models . In NIPS , 2002 . G. J. Gordon. Generalized2 linear2 models. In NIPS, 2002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(94)00047-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_3_2_1_20_1","unstructured":"Internet Movie Database Inc. IMDB interfaces. http:\/\/www.imdb.com\/interfaces Jan. 2007.  Internet Movie Database Inc. IMDB interfaces. http:\/\/www.imdb.com\/interfaces Jan. 2007."},{"key":"e_1_3_2_1_21_1","volume-title":"NIPS","author":"Lee D. D.","year":"2001","unstructured":"D. D. Lee and H. S. Seung . Algorithms for non-negative matrix factorization . In NIPS , 2001 . D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS, 2001."},{"key":"e_1_3_2_1_22_1","volume-title":"Block relaxation algorithms in statistics","author":"Leeuw J. D.","year":"1994","unstructured":"J. D. Leeuw . Block relaxation algorithms in statistics , 1994 . J. D. Leeuw. Block relaxation algorithms in statistics, 1994."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143918"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273568"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281244"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3242-6"},{"key":"e_1_3_2_1_27_1","unstructured":"Netflix. Netflix prize dataset. http:\/\/www.netflixprize.com Jan. 2007.  Netflix. Netflix prize dataset. http:\/\/www.netflixprize.com Jan. 2007."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143931"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"e_1_3_2_1_32_1","volume-title":"ICML","author":"Srebro N.","year":"2003","unstructured":"N. Srebro and T. Jaakola . Weighted low-rank approximations . In ICML , 2003 . N. Srebro and T. Jaakola. Weighted low-rank approximations. In ICML, 2003."},{"key":"e_1_3_2_1_33_1","volume-title":"NIPS","author":"Srebro N.","year":"2004","unstructured":"N. Srebro , J. D. Rennie , and T. S. Jaakkola . Maximum-margin matrix factorization . In NIPS , 2004 . N. Srebro, J. D. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In NIPS, 2004."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267055"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076080"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150454"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277825"}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Las Vegas Nevada USA","acronym":"KDD08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401969","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:41Z","timestamp":1750255001000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":36,"alternative-id":["10.1145\/1401890.1401969","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401969","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}