{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:08:36Z","timestamp":1757621316723,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_14","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:16Z","timestamp":1754168956000},"page":"181-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coresets for\u00a0k-Median of\u00a0Lines with\u00a0Group Fairness Constraints"],"prefix":"10.1007","author":[{"given":"Ting","family":"Liang","sequence":"first","affiliation":[]},{"given":"Xiaoliang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Junyu","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"14_CR1","unstructured":"Bera, S.K., Chakrabarty, D., Flores, N.J., Negahbani, M.: Fair algorithms for clustering. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, pp. 4954\u20134965 (2019)"},{"key":"14_CR2","unstructured":"Bercea, I.O., et al.: On the cost of essentially fair clusterings. In: Proceedings of the 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, pp. 18:1\u201318:22 (2019)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3559764","volume":"19","author":"M Buchin","year":"2023","unstructured":"Buchin, M., Driemel, A., Rohde, D.: Approximating $$(k, \\ell )$$-median clustering for polygonal curves. ACM Trans. Algorithms 19(1), 1\u201332 (2023)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR4","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 5036\u20135044 (2017)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Feldman, D., Schulman, L.J.: Data reduction for weighted and outlier-resistant clustering. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1343\u20131354 (2012)","DOI":"10.1137\/1.9781611973099.106"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00454-008-9107-5","volume":"40","author":"J Gao","year":"2008","unstructured":"Gao, J., Langberg, M., Schulman, L.J.: Analysis of incomplete data and an intrinsic-dimension helly theorem. Discrete Comput. Geom. 40, 537\u2013560 (2008)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1868237.1868246","volume":"7","author":"J Gao","year":"2010","unstructured":"Gao, J., Langberg, M., Schulman, L.J.: Clustering lines in high-dimensional space: Classification of incomplete data. ACM Trans. Algorithms 7(1), 1\u201326 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","volume":"19","author":"P Hansen","year":"2009","unstructured":"Hansen, P., Brimberg, J., Uro\u0161evi\u0107, D., Mladenovi\u0107, N.: Solving large $$p$$-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Disc. 19, 351\u2013375 (2009)","journal-title":"Data Min. Knowl. Disc."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Hirano, S., Tsumoto, S.: Cluster analysis of time-series medical data based on the trajectory representation and multiscale comparison techniques. In: Proceedings of the 6th International Conference on Data Mining, pp. 896\u2013901 (2006)","DOI":"10.1109\/ICDM.2006.33"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/j.eswa.2011.08.045","volume":"39","author":"GT Ho","year":"2012","unstructured":"Ho, G.T., Ip, W., Lee, C.K., Mou, W.: Customer grouping for better resources allocation using GA based clustering technique. Expert Syst. Appl. 39(2), 1979\u20131987 (2012)","journal-title":"Expert Syst. Appl."},{"key":"14_CR11","unstructured":"Jubran, I., Feldman, D.: Minimizing sum of non-convex but piecewise log-lipschitz functions using coresets. arXiv preprint arXiv:1807.08446 (2018)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TPAMI.2018.2876253","volume":"42","author":"M Keuper","year":"2018","unstructured":"Keuper, M., Tang, S., Andres, B., Brox, T., Schiele, B.: Motion segmentation and multiple object tracking by correlation co-clustering. IEEE Trans. Pattern Anal. Mach. Intell. 42(1), 140\u2013153 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667054","volume":"57","author":"A Kumar","year":"2010","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 1\u201332 (2010)","journal-title":"J. ACM"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Lee, E., Schulman, L.J.: Clustering affine subspaces: hardness and algorithms. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 810\u2013827 (2013)","DOI":"10.1137\/1.9781611973105.58"},{"key":"14_CR15","unstructured":"Lotan, S., Shayda, E.E.S., Feldman, D.: Coreset for line-sets clustering. In: Proceedings of the 36th International Conference on Neural Information Processing Systems, pp. 37363\u201337375 (2022)"},{"key":"14_CR16","unstructured":"Marom, Y., Feldman, D.: $$k$$-means clustering of lines for big data. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, pp. 12817\u201312826 (2019)"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J Matou\u0161ek","year":"2000","unstructured":"Matou\u0161ek, J.: On approximate geometric $$k$$-clustering. Discrete Comput. Geom. 24(1), 61\u201384 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Ommer, B., Malik, J.: Multi-scale object detection by clustering lines. In: Proceedings of the 12th International Conference on Computer Vision, pp. 484\u2013491 (2009)","DOI":"10.1109\/ICCV.2009.5459200"},{"issue":"1","key":"14_CR19","first-page":"1865","volume":"14","author":"W Pan","year":"2013","unstructured":"Pan, W., Shen, X., Liu, B.: Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty. J. Mach. Learn. Res. 14(1), 1865\u20131889 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Paparrizos, J., Gravano, L.: $$k$$-shape: Efficient and accurate clustering of time series. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1855\u20131870 (2015)","DOI":"10.1145\/2723372.2737793"},{"key":"14_CR21","volume-title":"Clustering of lines","author":"T Perets","year":"2011","unstructured":"Perets, T.: Clustering of lines. Open University of Israel Ra\u2019anana, Israel (2011)"},{"issue":"15","key":"14_CR22","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1080\/014311698214398","volume":"19","author":"R Rollet","year":"1998","unstructured":"Rollet, R., Benie, G., Li, W., Wang, S., Boucher, J.: Image classification algorithm based on the RBF neural network and $$k$$-means. Int. J. Remote Sens. 19(15), 3003\u20133009 (1998)","journal-title":"Int. J. Remote Sens."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair $$k$$-means. In: Proceedings of the 17th International Workshop on Approximation and Online Algorithms, pp. 232\u2013251 (2020)","DOI":"10.1007\/978-3-030-39479-0_16"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/TCBB.2022.3143897","volume":"20","author":"X Shi","year":"2022","unstructured":"Shi, X., Liang, C., Wang, H.: Multiview robust graph-based clustering for cancer subtype identification. IEEE\/ACM Trans. Comput. Biol. Bioinf. 20(1), 544\u2013556 (2022)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."}],"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-981-95-0218-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:41:30Z","timestamp":1757335290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","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":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}