{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:59:34Z","timestamp":1760608774527,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T00:00:00Z","timestamp":1381536000000},"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":[[2013,10,12]]},"DOI":"10.1145\/2507157.2507169","type":"proceedings-article","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T12:23:54Z","timestamp":1382012634000},"page":"265-272","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Using maximum coverage to optimize recommendation systems in e-commerce"],"prefix":"10.1145","author":[{"given":"Mikael","family":"Hammar","sequence":"first","affiliation":[{"name":"Apptus Technologies, Lund, Sweden"}]},{"given":"Robin","family":"Karlsson","sequence":"additional","affiliation":[{"name":"Apptus Technologies, Lund, Sweden"}]},{"given":"Bengt J.","family":"Nilsson","sequence":"additional","affiliation":[{"name":"Malm\u00f6 University, Malm\u00f6, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2013,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148245"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to algorithms","author":"Cormen H","year":"2001","unstructured":"T. H Cormen , C. Stein , R.L. Rivest , and C.E. Leiserson . Introduction to algorithms . McGraw-Hill Higher Education , 2 nd edition, 2001 . T.H Cormen, C. Stein, R.L. Rivest, and C.E. Leiserson. Introduction to algorithms. McGraw-Hill Higher Education, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807378"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and D.S. Johnson . Computers and intractability: a guide to the theory of NP-completeness . W.H. Freeman and Company , 1979 . M.R. Garey and D.S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"e_1_3_2_1_12_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum D.S.","year":"1997","unstructured":"D.S. Hochbaum , editor. Approximation algorithms for NP-hard problems . PWS Publishing Company , 1997 . D.S. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390223"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019154432472"},{"key":"e_1_3_2_1_17_1","volume-title":"Time-dependent predictions of user purchases on e-commerce sites. Master's thesis","author":"Malmer T.","year":"2011","unstructured":"T. Malmer . Time-dependent predictions of user purchases on e-commerce sites. Master's thesis , Lund University , 2011 . T. Malmer. Time-dependent predictions of user purchases on e-commerce sites. Master's thesis, Lund University, 2011."},{"key":"e_1_3_2_1_18_1","first-page":"697","volume-title":"Proceedings of SIAM SDM'09","author":"Saha B.","year":"2009","unstructured":"B. Saha and L. Getoor . On maximum coverage in the streaming model & application to multitopic blog-watch . In Proceedings of SIAM SDM'09 , pages 697 -- 708 , 2009 . B. Saha and L. Getoor. On maximum coverage in the streaming model & application to multitopic blog-watch. In Proceedings of SIAM SDM'09, pages 697--708, 2009."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90062-4"},{"key":"e_1_3_2_1_20_1","volume-title":"Approximation algorithms","author":"Vazirani V.V.","year":"2001","unstructured":"V.V. Vazirani . Approximation algorithms . Springer-Verlag , 2001 . V.V. Vazirani. Approximation algorithms. Springer-Verlag, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516404"}],"event":{"name":"RecSys '13: Seventh ACM Conference on Recommender Systems","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"],"location":"Hong Kong China","acronym":"RecSys '13"},"container-title":["Proceedings of the 7th ACM conference on Recommender systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2507157.2507169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2507157.2507169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:37Z","timestamp":1750231717000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2507157.2507169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,12]]},"references-count":22,"alternative-id":["10.1145\/2507157.2507169","10.1145\/2507157"],"URL":"https:\/\/doi.org\/10.1145\/2507157.2507169","relation":{},"subject":[],"published":{"date-parts":[[2013,10,12]]},"assertion":[{"value":"2013-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}