{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T19:49:45Z","timestamp":1791316185816,"version":"4.3.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,23]],"date-time":"2011-10-23T00:00:00Z","timestamp":1319328000000},"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":[[2011,10,23]]},"DOI":"10.1145\/2043932.2043943","type":"proceedings-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T12:23:06Z","timestamp":1319545386000},"page":"37-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["Wisdom of the better few"],"prefix":"10.1145","author":[{"given":"Nathan N.","family":"Liu","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Kownloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangrui","family":"Meng","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Liu","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, Uae"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[{"name":"Hong Kong Univesity of Science and Technology, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572033"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772699"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871569"},{"key":"e_1_3_2_1_4_1","first-page":"07","volume-title":"RPI Comp Sci Dept TR","author":"Civril A.","year":"2007"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.129"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"S. Goreinov L. Oaeledets D. Savostyanov E. Tyrtyshnikov and N. Zamarashkin. How to find a good submatrix. Matrix Methods: Theory Algorithms and Applications page 247 2010.  S. Goreinov L. Oaeledets D. Savostyanov E. Tyrtyshnikov and N. Zamarashkin. How to find a good submatrix. Matrix Methods: Theory Algorithms and Applications page 247 2010.","DOI":"10.1142\/9789812836021_0015"},{"key":"e_1_3_2_1_8_1","first-page":"47","volume-title":"Structured matrices in mathematics, computer science, and engineering: proceedings of an AMS-IMS-SIAM joint summer research conference","author":"Goreinov S.","year":"1999"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454013"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401935"},{"key":"e_1_3_2_1_11_1","volume-title":"Wiley-Interscience","author":"Kaufman L.","year":"2005"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639717"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00120-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150490"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557098"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/502716.502737"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/359784.360325"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835895"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.33"}],"event":{"name":"RecSys '11: Fifth ACM Conference on Recommender Systems","location":"Chicago Illinois USA","acronym":"RecSys '11","sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction","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","SIGIR ACM Special Interest Group on Information Retrieval","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the fifth ACM conference on Recommender systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2043932.2043943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2043932.2043943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:40Z","timestamp":1750240120000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2043932.2043943"}},"subtitle":["cold start recommendation via representative based rating elicitation"],"short-title":[],"issued":{"date-parts":[[2011,10,23]]},"references-count":21,"alternative-id":["10.1145\/2043932.2043943","10.1145\/2043932"],"URL":"https:\/\/doi.org\/10.1145\/2043932.2043943","relation":{},"subject":[],"published":{"date-parts":[[2011,10,23]]},"assertion":[{"value":"2011-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}