{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:30:38Z","timestamp":1778499038375,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":51,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819772377","type":"print"},{"value":"9789819772384","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-981-97-7238-4_21","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"325-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Identifying Rank-Happiness Maximizing Sets Under Group Fairness Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4003-4411","authenticated-orcid":false,"given":"Kaiqin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4378-5250","authenticated-orcid":false,"given":"Jiping","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1542-576X","authenticated-orcid":false,"given":"Zhengchen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3174-1100","authenticated-orcid":false,"given":"Jie","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"21_CR1","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: SEA, pp. 7:1\u20137:23 (2017)"},{"key":"21_CR2","unstructured":"Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., Torrico, A.: Structured robust submodular maximization: offline and online algorithms. In: AISTATS, pp. 3128\u20133137 (2019)"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3531054","volume":"47","author":"A Asudeh","year":"2022","unstructured":"Asudeh, A., et al.: On finding rank regret representatives. TODS 47(3), 1\u201337 (2022)","journal-title":"TODS"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Asudeh, A., Jagadish, H.V., Stoyanovich, J., Das, G.: Designing fair ranking schemes. In: SIGMOD, pp. 1259\u20131276 (2019)","DOI":"10.1145\/3299869.3300079"},{"key":"21_CR5","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 (2017)","DOI":"10.1145\/3035918.3035932"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Asudeh, A., Nazi, A., Zhang, N., Das, G., Jagadish, H.: RRR: rank-regret representative. In: SIGMOD, pp. 263\u2013280 (2019)","DOI":"10.1145\/3299869.3300080"},{"key":"21_CR7","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421\u2013430 (2001)"},{"key":"21_CR8","unstructured":"Celis, E., Keswani, V., Straszak, D., Deshpande, A., Kathuria, T., Vishnoi, N.: Fair and diverse DPP-based data summarization. In: ICML, pp. 716\u2013725 (2018)"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.14778\/2732269.2732275","volume":"7","author":"S Chester","year":"2014","unstructured":"Chester, S., Thomo, A., Srinivasan, V., Whitesides, S.: Computing k-regret minimizing sets. Proc. VLDB Endow. 7(5), 389\u2013400 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Dong, W., Islam, M.M., Schieber, B., Roy, S.B.: Rank aggregation with proportionate fairness. In: SIGMOD, pp. 262\u2013275 (2022)","DOI":"10.1145\/3514221.3517865"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jcss.1998.1600","volume":"58","author":"R Fagin","year":"1999","unstructured":"Fagin, R.: Combining fuzzy information from multiple systems. J. Comput. Syst. Sci. 58(1), 83\u201399 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.14778\/2831360.2831364","volume":"8","author":"TAK Faulkner","year":"2015","unstructured":"Faulkner, T.A.K., Brackenbury, W., Lall, A.: k-regret queries with nonlinear utilities. Proc. VLDB Endow. 8, 2098\u20132109 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"ML Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions\u2013ii. Math. Programm. Stud. 8, 73\u201387 (1978)","journal-title":"Math. Programm. Stud."},{"key":"21_CR14","first-page":"480","volume":"83","author":"T Fujito","year":"2000","unstructured":"Fujito, T.: Approximation algorithms for submodular set cover with applications. IEICE Trans. Inf. Syst. 83, 480\u2013487 (2000)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Soriano, D., Bonchi, F.: Maxmin-fair ranking: individual fairness under group-fairness constraints. In: KDD, pp. 436\u2013446 (2021)","DOI":"10.1145\/3447548.3467349"},{"key":"21_CR16","unstructured":"Halabi, M.E., Fusco, F., Norouzi-Fard, A., Tardos, J., Tarnawski, J.: Fairness in streaming submodular maximization over a matroid constraint. In: ICML, pp. 9150\u20139171 (2023)"},{"key":"21_CR17","unstructured":"Halabi, M.E., Mitrovic, S., Norouzi-Fard, A., Tardos, J., Tarnawski, J.: Fairness in streaming submodular maximization: algorithms and hardness. In: NeurIPS, pp. 13609\u201313622 (2020)"},{"key":"21_CR18","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k-center clustering for data summarization. In: ICML, pp. 3448\u20133457 (2019)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. In: Tractability (2014)","DOI":"10.1017\/CBO9781139177801.004"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., et al.: Hyperbolic hypergraphs for sequential recommendation. In: CIKM, pp. 988\u2013997 (2021)","DOI":"10.1145\/3459637.3482351"},{"key":"21_CR21","unstructured":"Luenam, P., Chen, Y.P., Wong, R.C.W.: Approximating happiness maximizing set problems. ArXiv abs\/2102.03578 (2021)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Mehrotra, A., Celis, L.E.: Mitigating bias in set selection with noisy protected attributes. In: FAccT, pp. 237\u2013248 (2021)","DOI":"10.1145\/3442188.3445887"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Minoux, M.: Accelerated greedy algorithms for maximizing submodular set functions. In: Proceedings of IFIP Conference on Optimization Techniques, pp. 234\u2013243 (1978)","DOI":"10.1007\/BFb0006528"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.14778\/1920841.1920980","volume":"3","author":"D Nanongkai","year":"2010","unstructured":"Nanongkai, D., Sarma, A., Lall, A., Lipton, R., Xu, J.: Regret-minimizing representative databases. Proc. VLDB Endow. 3(1), 1114\u20131124 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Lall, A., Sarma, A.D., Makino, K.: Interactive regret minimization. In: SIGMOD, pp. 109\u2013120 (2012)","DOI":"10.1145\/2213836.2213850"},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"22","key":"21_CR27","doi-asserted-by":"publisher","first-page":"4185","DOI":"10.3390\/math10224185","volume":"10","author":"BNT Nguyen","year":"2022","unstructured":"Nguyen, B.N.T., Pham, P.N., Le, V.V., Sn\u00e1\u0161el, V.: Influence maximization under fairness budget distribution in online social networks. Mathematics 10(22), 4185 (2022)","journal-title":"Mathematics"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Peng, P., Wong, R.C.W.: Geometry approach for k-regret query. In: ICDE, pp. 772\u2013783 (2014)","DOI":"10.1109\/ICDE.2014.6816699"},{"issue":"3","key":"21_CR29","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00778-021-00697-y","volume":"31","author":"E Pitoura","year":"2022","unstructured":"Pitoura, E., Stefanidis, K., Koutrika, G.: Fairness in rankings and recommendations: an overview. VLDB J. 31(3), 431\u2013458 (2022)","journal-title":"VLDB J."},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Qi, J., Zuo, F., Samet, H., Yao, J.C.: k-regret queries using multiplicative utility functions. TODS 43(2), 10:1\u201310:41 (2018)","DOI":"10.1145\/3230634"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Qiu, X., Zheng, J.: An efficient algorithm for computing k-average-regret minimizing sets in databases. In: WISA, pp. 404\u2013412 (2018)","DOI":"10.1007\/978-3-030-02934-0_37"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Qiu, X., Zheng, J., Dong, Q., Huang, X.: Speed-up algorithms for happiness-maximizing representative databases. In: APWebWAIM DS Workshop, pp. 321\u2013335 (2018)","DOI":"10.1007\/978-3-030-01298-4_27"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Singh, A., Joachims, T.: Fairness of exposure in rankings. In: KDD, pp. 2219\u20132228 (2018)","DOI":"10.1145\/3219819.3220088"},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"Sonboli, N., Eskandanian, F., Burke, R., Liu, W., Mobasher, B.: Opportunistic multi-aspect fairness through personalized re-ranking. In: UMAP, pp. 239\u2013247 (2020)","DOI":"10.1145\/3340631.3394846"},{"key":"21_CR35","unstructured":"Stoyanovich, J., Yang, K., Jagadish, H.V.: Online set selection with fairness and diversity constraints. In: EDBT, pp. 241\u2013252 (2018)"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Wang, Y., Fabbri, F., Mathioudakis, M.: Fair and representative subset selection from data streams. In: WWW, pp. 1340\u20131350 (2021)","DOI":"10.1145\/3442381.3449799"},{"key":"21_CR37","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 (2021)","DOI":"10.1109\/ICDE51399.2021.00144"},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"Xiao, X., Li, J.: Rank-regret minimization. In: ICDE, pp. 1848\u20131860 (2022)","DOI":"10.1109\/ICDE53745.2022.00184"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R.C., Lall, A.: Strongly truthful interactive regret minimization. In: SIGMOD, pp. 281\u2013298 (2019)","DOI":"10.1145\/3299869.3300068"},{"key":"21_CR40","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00778-019-00570-z","volume":"29","author":"M Xie","year":"2020","unstructured":"Xie, M., Wong, R.C.W., Lall, A.: An experimental survey of regret minimization query and variants: bridging the best worlds between top-k query and skyline query. VLDB J. 29, 147\u2013175 (2020)","journal-title":"VLDB J."},{"key":"21_CR41","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 (2018)","DOI":"10.1145\/3183713.3196903"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R.C., Peng, P., Tsotras, V.J.: Being happy with the least: achieving $$\\alpha $$-happiness with minimum number of tuples. In: ICDE, pp. 1009\u20131020 (2020)","DOI":"10.1109\/ICDE48307.2020.00092"},{"key":"21_CR43","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zheng, J.: Online submodular maximization via adaptive thresholds. In: IJCAI (2024)","DOI":"10.24963\/ijcai.2024\/781"},{"issue":"2","key":"21_CR44","first-page":"3","volume":"44","author":"C Zaniolo","year":"2021","unstructured":"Zaniolo, C., Das, A., Gu, J., Li, Y., Li, M., Wang, J.: Developing big-data application as queries: an aggregate-based approach. IEEE Data Eng. Bull. 44(2), 3\u201313 (2021)","journal-title":"IEEE Data Eng. Bull."},{"key":"21_CR45","doi-asserted-by":"crossref","unstructured":"Zeighami, S., Wong, R.C.W.: Minimizing average regret ratio in database. In: SIGMOD, pp. 2265\u20132266 (2016)","DOI":"10.1145\/2882903.2914831"},{"key":"21_CR46","doi-asserted-by":"crossref","unstructured":"Zeighami, S., Wong, R.C.W.: Finding average regret ratio minimizing set in database. In: ICDE, pp. 1722\u20131725 (2019)","DOI":"10.1109\/ICDE.2019.00182"},{"key":"21_CR47","doi-asserted-by":"crossref","unstructured":"Zheng, J., Chen, C.: Sorting-based interactive regret minimization. In: APWeb-WAIM, pp. 473\u2013490 (2020)","DOI":"10.1007\/978-3-030-60290-1_36"},{"key":"21_CR48","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, 99\u2013118 (2022)","journal-title":"Inf. Sci."},{"issue":"2","key":"21_CR49","doi-asserted-by":"publisher","first-page":"291","DOI":"10.14778\/3565816.3565830","volume":"16","author":"J Zheng","year":"2022","unstructured":"Zheng, J., Ma, Y., Ma, W., Wang, Y., Wang, X.: Happiness maximizing sets under group fairness constraints. Proc. VLDB Endow. 16(2), 291\u2013303 (2022)","journal-title":"Proc. VLDB Endow."},{"issue":"7","key":"21_CR50","doi-asserted-by":"publisher","first-page":"3151","DOI":"10.1109\/TKDE.2023.3328596","volume":"36","author":"J Zheng","year":"2024","unstructured":"Zheng, J., et al.: Hybrid regret minimization: a submodular approach. IEEE Trans. Knowl. Data Eng. 36(7), 3151\u20133165 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"21_CR51","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."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7238-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T09:40:31Z","timestamp":1732700431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7238-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772377","9789819772384"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7238-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}