{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:49:30Z","timestamp":1742942970341,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434112"},{"type":"electronic","value":"9783031434129"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43412-9_43","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:28:38Z","timestamp":1694896118000},"page":"727-742","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Socially Fair Center-Based and\u00a0Linear Subspace Clustering"],"prefix":"10.1007","author":[{"given":"Sruthi","family":"Gorantla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kishen N.","family":"Gowda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Deshpande","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Louis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Abbasi, M., Bhaskara, A., Venkatasubramanian, S.: Fair clustering via equitable group representations. In: FAccT (2021)","DOI":"10.1145\/3442188.3445913"},{"key":"43_CR2","unstructured":"Awasthi, P., Blum, A., Sheffet, O.: Clustering under natural stability assumptions (2002)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Awasthi, P., Blum, A., Sheffet, O.: Stability yields a PTAS for K-median and K-means clustering. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.36"},{"key":"43_CR4","unstructured":"Bandyapadhyay, S., Fomin, F.V., Simonov, K.: On coresets for fair clustering in metric and Euclidean spaces and their applications (2020)"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Barocas, S., Selbst, A.D.: Big data\u2019s disparate impact. Calif. L. Rev. (2016)","DOI":"10.2139\/ssrn.2477899"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Batur, A.U., III, M.H.H.: Segmented linear subspaces for illumination-robust face recognition. Int. J. Comput. Vis. 57, 49\u201366 (2004)","DOI":"10.1023\/B:VISI.0000013090.39095.d5"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Bewley, A., Shekhar, R., Leonard, S., Upcroft, B., Lever, P.: Real-time volume estimation of a dragline payload. In: 2011 IEEE International Conference on Robotics and Automation (2011)","DOI":"10.1109\/ICRA.2011.5979898"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster algorithms for the constrained K-means problem. Theor. Comp. Syst. 62, 93\u2013115 (2018)","DOI":"10.1007\/s00224-017-9820-7"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1c, E., Makarychev, Y., Vakilian, A.: Approximating fair clustering with cascaded norm objectives. In: SODA (2022)","DOI":"10.1137\/1.9781611977073.104"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Saulpic, D., Schwiegelshohn, C.: A new coreset framework for clustering (2021)","DOI":"10.1145\/3406325.3451022"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Tulsiani, M., Vishnoi, N.K.: Algorithms and hardness for subspace approximation. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.39"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X.: K-means clustering via principal component analysis. In: ICML (2004)","DOI":"10.1145\/1015330.1015408"},{"key":"43_CR13","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: STOC (2011)","DOI":"10.1145\/1993636.1993712"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Ghadiri, M., Samadi, S., Vempala, S.: Socially fair k-means clustering. In: FAccT. Association for Computing Machinery (2021)","DOI":"10.1145\/3442188.3445906"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Ghadiri, M., Singh, M., Vempala, S.S.: Constant-factor approximation algorithms for socially fair $$k$$-clustering (2022)","DOI":"10.1145\/3442188.3445906"},{"key":"43_CR17","unstructured":"Gorantla, S., Gowda, K.N., Deshpande, A., Louis, A.: Socially fair center-based and linear subspace clustering (2022). arxiv.org\/abs\/2208.10095"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Goyal, D., Jaiswal, R.: FPT approximation for socially fair clustering. CoRR (2021)","DOI":"10.2139\/ssrn.4226483"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Haben, S., Singleton, C., Grindrod, P.: Analysis and clustering of residential customers energy behavioral demand using smart meter data. IEEE Trans. Smart Grid (2016)","DOI":"10.1109\/TSG.2015.2409786"},{"key":"43_CR20","unstructured":"Hamerly, G., Elkan, C.: Learning the K in K-means. In: NeurIPS (2003)"},{"key":"43_CR21","unstructured":"Ho, J., Yang, M.H., Lim, J., Lee, K.C., Kriegman, D.: Clustering appearances of objects under varying illumination conditions. In: CVPR (2003)"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Holzer, H.J., Neumark, D.: What does affirmative action do? ILR Rev. (2000)","DOI":"10.3386\/w7323"},{"key":"43_CR23","unstructured":"Huang, L., Jiang, S., Vishnoi, N.K.: Coresets for clustering with fairness constraints. In: NeurIPS (2019)"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Huang, L., Vishnoi, N.K.: Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal. In: STOC (2020)","DOI":"10.1145\/3357713.3384296"},{"key":"43_CR25","doi-asserted-by":"crossref","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A local search approximation algorithm for K-means clustering. Comput. Geometry (2004). Special Issue on the 18th Annual Symposium on Computational Geometry - SoCG2002","DOI":"10.1145\/513400.513402"},{"key":"43_CR26","unstructured":"Karlgren, J.: Newsgroup clustering based on user behavior - a recommendation algebra (1994)"},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Lee, K.C., Ho, J., Kriegman, D.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27, 684\u2013698 (2005)","DOI":"10.1109\/TPAMI.2005.92"},{"key":"43_CR28","unstructured":"Makarychev, K., Makarychev, Y., Razenshteyn, I.: Performance of Johnson-lindenstrauss transform for K-means and K-medians clustering. In: STOC (2019)"},{"key":"43_CR29","unstructured":"Makarychev, Y., Vakilian, A.: Approximation algorithms for socially fair clustering. ArXiv (2021)"},{"key":"43_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-77004-6_5","volume-title":"Algorithms and Models for the Web-Graph","author":"N Mishra","year":"2007","unstructured":"Mishra, N., Schreiber, R., Stanton, I., Tarjan, R.E.: Clustering social networks. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 56\u201367. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_5"},{"key":"43_CR31","doi-asserted-by":"crossref","unstructured":"Moro, S., Cortez, P., Rita, P.: A data-driven approach to predict the success of bank telemarketing. Decis. Support Syst. 62, 22\u201331 (2014)","DOI":"10.1016\/j.dss.2014.03.001"},{"key":"43_CR32","unstructured":"Mu, J., Bhat, S., Viswanath, P.: Geometry of polysemy. In: ICLR (2017)"},{"key":"43_CR33","doi-asserted-by":"crossref","unstructured":"Mu, J., Bhat, S., Viswanath, P.: Representing sentences as low-rank subspaces. In: ACL (2017)","DOI":"10.18653\/v1\/P17-2099"},{"key":"43_CR34","doi-asserted-by":"crossref","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review 6(1), 90\u2013105 (2004)","DOI":"10.1145\/1007730.1007731"},{"key":"43_CR35","unstructured":"Pelleg, D., Moore, A.W.: X-means: extending K-means with efficient estimation of the number of clusters. In: ICML (2000)"},{"key":"43_CR36","unstructured":"Samadi, S., Tantipongpipat, U., Morgenstern, J.H., Singh, M., Vempala, S.: The price of fair PCA: one extra dimension. In: NeurIPS (2018)"},{"key":"43_CR37","doi-asserted-by":"crossref","unstructured":"Schubert, E., Rousseeuw, P.J.: Fast and eager K-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms. Inf. Syst. 101, 101804 (2021)","DOI":"10.1016\/j.is.2021.101804"},{"key":"43_CR38","doi-asserted-by":"crossref","unstructured":"Thompson, J.J., Blair, M.R., Chen, L., Henrey, A.J.: Video game telemetry as a critical tool in the study of complex skill learning. PLOS ONE 8, e75129 (2013)","DOI":"10.1371\/journal.pone.0075129"},{"key":"43_CR39","unstructured":"Tukan, M., Wu, X., Zhou, S., Braverman, V., Feldman, D.: New coresets for projective clustering and applications. In: AIStats (2022)"},{"key":"43_CR40","unstructured":"Vidal, R.: A tutorial on subspace clustering (2010)"},{"key":"43_CR41","doi-asserted-by":"crossref","unstructured":"Yeh, I.C., hui Lien, C.: The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients. Exp. Syst. Appl. 36, 2473\u20132480 (2009)","DOI":"10.1016\/j.eswa.2007.12.020"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43412-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:36:00Z","timestamp":1694896560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43412-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434112","9783031434129"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43412-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","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":"196","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":"24% - 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.63","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":"4.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}