{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:20Z","timestamp":1750220900046,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1618932"],"award-info":[{"award-number":["CNS-1618932"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"AFOSR","award":["FA9550-12-1-0240"],"award-info":[{"award-number":["FA9550-12-1-0240"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3357838","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"2913-2916","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SkyRec"],"prefix":"10.1145","author":[{"given":"Jinfei","family":"Liu","sequence":"first","affiliation":[{"name":"Emory University & Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xiong","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[{"name":"Machine Intelligence Center Lenovo Group Limited, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Si","family":"Zhang","sequence":"additional","affiliation":[{"name":"Jianghan University, Wuhang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"151","volume":"188","author":"Im H.","year":"2012","journal-title":"Group skyline computation. Inf. Sci."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398585"},{"issue":"13","key":"e_1_3_2_1_3_1","first-page":"2086","volume":"8","author":"Liu J.","year":"2015","journal-title":"Finding pareto optimal groups: Group-based skyline. PVLDB"},{"issue":"12","key":"e_1_3_2_1_4_1","volume":"114","author":"Liu J.","year":"2014","journal-title":"Faster output-sensitive skyline computation algorithm. Inf. Process. Lett."},{"volume-title":"Efficient contour computation of group-based skyline. CoRR, abs\/1905.00700","year":"2019","author":"Yu W.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132950"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.119"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"CIKM '19"},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357838","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357838","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:43Z","timestamp":1750203883000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357838"}},"subtitle":["Finding Pareto Optimal Groups"],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":7,"alternative-id":["10.1145\/3357384.3357838","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3357838","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}