{"id":"https://openalex.org/W7138367715","doi":"https://doi.org/10.1609/aaai.v40i24.39077","title":"Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications","display_name":"Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138367715","doi":"https://doi.org/10.1609/aaai.v40i24.39077"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i24.39077","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i24.39077","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i24.39077","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024602075","display_name":"Diptarka Chakraborty","orcid":"https://orcid.org/0000-0002-0687-5823"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Diptarka Chakraborty","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129718123","display_name":"Kushagra Chatterjee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kushagra Chatterjee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129698719","display_name":"Debarati Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Debarati Das","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112876047","display_name":"Tien-Long Nguyen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tien-Long Nguyen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024602075"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27118644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"24","first_page":"19934","last_page":"19942"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.16820000112056732,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.16820000112056732,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.1371999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10883","display_name":"Ethics and Social Impacts of AI","score":0.065700002014637,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8590999841690063},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5475999712944031},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5030999779701233},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.45989999175071716},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41110000014305115},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.3783999979496002},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.3752000033855438},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.37049999833106995}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8590999841690063},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5475999712944031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5198000073432922},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5030999779701233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49549999833106995},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.45989999175071716},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41110000014305115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40139999985694885},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.37049999833106995},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3569999933242798},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34709998965263367},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.329800009727478},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.31610000133514404},{"id":"https://openalex.org/C207968372","wikidata":"https://www.wikidata.org/wiki/Q310401","display_name":"k-means clustering","level":3,"score":0.3093999922275543},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28859999775886536},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.2782000005245209},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2669000029563904},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.262800008058548},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i24.39077","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i24.39077","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i24.39077","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i24.39077","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Clustering":[0],"is":[1,43,142],"a":[2,29,40,44,61,79,153],"fundamental":[3],"task":[4],"in":[5,35,78],"machine":[6],"learning":[7],"and":[8],"data":[9,83,93],"analysis,":[10],"but":[11],"it":[12],"frequently":[13],"fails":[14],"to":[15,47,86,124,206],"provide":[16,207],"fair":[17,75,121,182,193,212],"representation":[18],"for":[19,160,191,210],"various":[20],"marginalized":[21],"communities":[22],"defined":[23],"by":[24,33,55,98,137],"multiple":[25,177,217],"protected":[26,103],"attributes":[27,104],"--":[28,152],"shortcoming":[30],"often":[31],"caused":[32],"biases":[34],"the":[36,49,71,116,119,140,157,192,198,204,211],"training":[37],"data.":[38],"As":[39],"result,":[41],"there":[42],"growing":[45],"need":[46],"enhance":[48],"fairness":[50],"of":[51,73,118,133,149],"clustering":[52,122,183,195,214],"outcomes,":[53],"ideally":[54],"making":[56],"minimal":[57],"modifications,":[58],"possibly":[59],"as":[60,106],"post-processing":[62],"step":[63],"after":[64],"conventional":[65],"clustering.":[66],"A":[67],"recent":[68],"work":[69],"initiated":[70],"study":[72,117],"closest":[74,120,181],"clustering,":[76],"though":[77],"restricted":[80],"scenario":[81],"where":[82],"points":[84,94],"belong":[85],"only":[87],"two":[88],"groups.":[89,134,178,221],"In":[90,111],"practice,":[91],"however,":[92],"are":[95,148,203],"typically":[96],"characterized":[97],"many":[99],"groups,":[100],"reflecting":[101],"diverse":[102],"such":[105],"age,":[107],"ethnicity,":[108],"gender,":[109],"etc.":[110],"this":[112],"work,":[113],"we":[114,167,185,202],"generalize":[115],"problem":[123,141,215],"settings":[125],"with":[126,156],"an":[127,162],"arbitrary":[128],"number":[129],"(more":[130,218],"than":[131,219],"two)":[132,220],"We":[135],"begin":[136],"showing":[138],"that":[139,173],"NP-hard":[143],"even":[144],"when":[145],"all":[146],"groups":[147],"equal":[150],"size":[151],"stark":[154],"contrast":[155],"two-group":[158],"case,":[159],"which":[161],"exact":[163],"algorithm":[164],"exists.":[165],"Next,":[166],"propose":[168],"near-linear":[169],"time":[170],"approximation":[171,189,208],"algorithms":[172,209],"efficiently":[174],"handle":[175],"arbitrary-sized":[176],"Leveraging":[179],"our":[180],"algorithms,":[184],"further":[186],"achieve":[187],"improved":[188],"guarantees":[190],"correlation":[194],"problem,":[196],"advancing":[197],"state-of-the-art":[199],"results.":[200],"Additionally,":[201],"first":[205],"consensus":[213],"involving":[216]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2026-03-18T00:00:00"}