{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:19:50Z","timestamp":1777339190389,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819722617","type":"print"},{"value":"9789819722594","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-2259-4_8","type":"book-chapter","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T09:02:31Z","timestamp":1713949351000},"page":"105-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Streaming Fair k-Center Clustering over\u00a0Massive Dataset with\u00a0Performance Guarantee"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6122-0121","authenticated-orcid":false,"given":"Zeyu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6548-390X","authenticated-orcid":false,"given":"Chaoqi","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"8_CR1","unstructured":"Asuncion, A., Newman, D.: UCI machine learning repository (2007)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: Massive data summarization on the fly. In: 20th International Conference on Knowledge Discovery and Data Mining(ACM SIGKDD), pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Friggstad, Z., Mousavi, R.: Parameterized approximation algorithms for $$k$$-center clustering and variants. In: 36th AAAI Conference on Artificial Intelligence. vol.\u00a036, pp. 3895\u20133903 (2022)","DOI":"10.1609\/aaai.v36i4.20305"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Ceccarello, M., Pietracaprina, A., Pucci, G.: Solving k-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially. In: 45th International Conference on Very Large Databases(VLDB), pp. 766\u2013778 (2019)","DOI":"10.14778\/3317315.3317319"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-015-0010-1","volume":"75","author":"DZ Chen","year":"2016","unstructured":"Chen, D.Z., Li, J., Liang, H., Wang, H.: Matroid and knapsack center problems. Algorithmica 75, 27\u201352 (2016)","journal-title":"Algorithmica"},{"key":"8_CR6","unstructured":"Chiplunkar, A., Kale, S., Ramamoorthy, S.N.: How to solve fair k-center in massive data models. In: 37th International Conference on Machine Learning(ICML), pp. 1877\u20131886 (2020)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: 21th International Conference on Knowledge Discovery and Data Mining(ACM SIGKDD), pp. 259\u2013268 (2015)","DOI":"10.1145\/2783258.2783311"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fritz, M., Behringer, M., Schwarz, H.: Log-means: efficiently estimating the number of clusters in large datasets. In: 46th International Conference on Very Large Databases (VLDB), pp. 2118\u20132131 (2020)","DOI":"10.14778\/3407790.3407813"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Holstein, K., Wortman\u00a0Vaughan, J., Daum\u00e9\u00a0III, H., Dudik, M., Wallach, H.: Improving fairness in machine learning systems: What do industry practitioners need? In: CHI Conference on Human Factors in Computing Systems, pp. 1\u201316 (2019)","DOI":"10.1145\/3290605.3300830"},{"key":"8_CR10","unstructured":"Hotegni, S.S., Mahabadi, S., Vakilian, A.: Approximation algorithms for fair range clustering. In: 40th International Conference on Machine Learning (ICML), pp. 13270\u201313284 (2023)"},{"key":"8_CR11","unstructured":"Jones, M., Nguyen, H., Nguyen, T.: Fair $$k$$-centers via maximum matching. In: 37th International Conference on Machine Learning(ICML). pp. 4940\u20134949 (2020)"},{"key":"8_CR12","unstructured":"Kale, S.: Small space stream summary for matroid center. Approximation, Randomization, and Combinatorial Optimization. Algorithms Tech. 145, 20 (2019)"},{"key":"8_CR13","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair $$k$$-center clustering for data summarization. In: 36th International Conference on Machine Learning (ICML), pp. 3448\u20133457 (2019)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Matthew\u00a0McCutchen, R., Khuller, S.: Streaming algorithms for $$k$$-center clustering with outliers and with anonymity. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, pp. 165\u2013178 (2008)","DOI":"10.1007\/978-3-540-85363-3_14"},{"issue":"5","key":"8_CR15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/2447976.2447990","volume":"56","author":"L Sweeney","year":"2013","unstructured":"Sweeney, L.: Discrimination in online ad delivery. Commun. ACM 56(5), 44\u201354 (2013)","journal-title":"Commun. ACM"},{"issue":"4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1177\/0008125619867910","volume":"61","author":"P Tambe","year":"2019","unstructured":"Tambe, P., Cappelli, P., Yakubovich, V.: Artificial intelligence in human resources management: challenges and a path forward. Calif. Manage. Rev. 61(4), 15\u201342 (2019)","journal-title":"Calif. Manage. Rev."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2259-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T23:17:18Z","timestamp":1714000638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2259-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722617","9789819722594"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2259-4_8","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":"25 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}