{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:51Z","timestamp":1742913891845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_19","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"250-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diversity and\u00a0Freshness-Aware Regret Minimizing Set Queries"],"prefix":"10.1007","author":[{"given":"Hongjie","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangyao","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 1\u201358 (2008)","journal-title":"ACM Comput. Surv."},{"key":"19_CR2","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421\u2013430. IEEE (2001)"},{"issue":"1\u20132","key":"19_CR3","first-page":"1114","volume":"3","author":"D Nanongkai","year":"2010","unstructured":"Nanongkai, D., Sarma, A.D., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. PVLDB 3(1\u20132), 1114\u20131124 (2010)","journal-title":"PVLDB"},{"issue":"5","key":"19_CR4","first-page":"389","volume":"7","author":"S Chester","year":"2014","unstructured":"Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Computing k-regret minimizing sets. PVLDB 7(5), 389\u2013400 (2014)","journal-title":"PVLDB"},{"key":"19_CR5","unstructured":"Cao, W., et al.: k-regret minimizing set: efficient algorithms and hardness. In: ICDT, pp. 11:1\u201311:19. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"19_CR6","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: SEA, pp. 7:1\u20137:23. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R.C., Li, J., Long, C., Lall, A.: Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In: SIGMOD, pp. 959\u2013974. ACM (2018)","DOI":"10.1145\/3183713.3196903"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Asudeh, A., Nazi, A., Zhang, N., Das, G.: Efficient computation of regret-ratio minimizing set: a compact maxima representative. In: SIGMOD, pp. 821\u2013834. ACM (2017)","DOI":"10.1145\/3035918.3035932"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2021.11.080","volume":"586","author":"J Zheng","year":"2022","unstructured":"Zheng, J., Dong, Q., Wang, X., Zhang, Y., Ma, W., Ma, Y.: Efficient processing of k-regret minimization queries with theoretical guarantees. Inf. Sci. 586(1), 99\u2013118 (2022)","journal-title":"Inf. Sci."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, Y., Wong, R.C.W., Tan, K.L.: A fully dynamic algorithm for k-regret minimizing sets. In: ICDE, pp. 1631\u20131642. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00144"},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"5680","DOI":"10.1109\/TKDE.2022.3166835","volume":"35","author":"J Zheng","year":"2023","unstructured":"Zheng, J., Wang, Y., Wang, X., Ma, W.: Continuous k-regret minimization queries: a dynamic coreset approach. IEEE Trans. Knowl. Data Eng. 35(6), 5680\u20135694 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2487259.2487262","volume":"38","author":"I Catallo","year":"2013","unstructured":"Catallo, I., Ciceri, E., Fraternali, P., Martinenghi, D., Tagliasacchi, M.: Top-k diversity queries over bounded regions. ACM Trans. Database Syst. 38(2), 1\u201344 (2013)","journal-title":"ACM Trans. Database Syst."},{"key":"19_CR13","unstructured":"Moumoulidou, Z., McGregor, A., Meliou, A.: Diverse data selection under fairness constraints. In: ICDT 2021, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2021)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sintos, S., Steiger, A.: Efficient indexes for diverse Top-k range queries. In: PODS, pp. 213\u2013227. ACM (2020)","DOI":"10.1145\/3375395.3387667"},{"issue":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-8324-9","volume":"14","author":"M Zhang","year":"2020","unstructured":"Zhang, M., Wang, H., Li, J., Gao, H.: Diversification on big data in query processing. Front. Comput. Sci. 14(4), 1\u201320 (2020)","journal-title":"Front. Comput. Sci."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: PODS, pp. 155\u2013166. ACM (2012)","DOI":"10.1145\/2213556.2213580"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., Mathioudakis, M., Li, Y., Tan, K.L.: Minimum coresets for maxima representation of multidimensional data. In: PODS, pp. 138\u2013152. ACM (2021)","DOI":"10.1145\/3452021.3458322"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, N., Sintos, S.: Faster approximation algorithm for the k-regret minimizing set and related problems. In: ALENEX, pp. 62\u201374. SIAM (2018)","DOI":"10.1137\/1.9781611975055.6"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF03024331","volume":"19","author":"EB Saff","year":"1997","unstructured":"Saff, E.B., Kuijlaars, A.B.J.: Distributing many points on a sphere. Math. Intelligencer 19(1), 5\u201311 (1997)","journal-title":"Math. Intelligencer"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G Dobson","year":"1982","unstructured":"Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 7(4), 515\u2013531 (1982)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:05:42Z","timestamp":1702026342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}