{"id":"https://openalex.org/W7138911033","doi":"https://doi.org/10.1609/aaai.v40i43.41022","title":"Improved Streaming Algorithm for Fair k-Center Clustering","display_name":"Improved Streaming Algorithm for Fair k-Center Clustering","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138911033","doi":"https://doi.org/10.1609/aaai.v40i43.41022"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i43.41022","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41022","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41022/44983","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://ojs.aaai.org/index.php/AAAI/article/download/41022/44983","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121753410","display_name":"Longkun Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]},{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]},{"id":"https://openalex.org/I83791580","display_name":"Fujian University of Technology","ror":"https://ror.org/03c8fdb16","country_code":"CN","type":"education","lineage":["https://openalex.org/I83791580"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Longkun Guo","raw_affiliation_strings":["Fuzhou University\nGuangdong University of Technology"],"affiliations":[{"raw_affiliation_string":"Fuzhou University\nGuangdong University of Technology","institution_ids":["https://openalex.org/I83791580","https://openalex.org/I80947539","https://openalex.org/I139024713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130133773","display_name":"Zeyu Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zeyu Lin","raw_affiliation_strings":["Fuzhou University"],"affiliations":[{"raw_affiliation_string":"Fuzhou University","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123332036","display_name":"Chaoqi Jia","orcid":null},"institutions":[{"id":"https://openalex.org/I4210135439","display_name":"RMIT Europe","ror":"https://ror.org/03m3ca021","country_code":"ES","type":"education","lineage":["https://openalex.org/I4210135439","https://openalex.org/I82951845"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Chaoqi Jia","raw_affiliation_strings":["Royal Melbourne Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Royal Melbourne Institute of Technology","institution_ids":["https://openalex.org/I4210135439"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100408358","display_name":"Chao Chen","orcid":"https://orcid.org/0000-0002-5114-2282"},"institutions":[{"id":"https://openalex.org/I4210135439","display_name":"RMIT Europe","ror":"https://ror.org/03m3ca021","country_code":"ES","type":"education","lineage":["https://openalex.org/I4210135439","https://openalex.org/I82951845"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Chao Chen","raw_affiliation_strings":["Royal Melbourne Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Royal Melbourne Institute of Technology","institution_ids":["https://openalex.org/I4210135439"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5121753410"],"corresponding_institution_ids":["https://openalex.org/I139024713","https://openalex.org/I80947539","https://openalex.org/I83791580"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.83333333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"43","first_page":"36946","last_page":"36954"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.41690000891685486,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.41690000891685486,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.11509999632835388,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.07840000092983246,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.692799985408783},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.6316999793052673},{"id":"https://openalex.org/keywords/streaming-data","display_name":"Streaming data","score":0.5978999733924866},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5795000195503235},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5482000112533569},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4636000096797943},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.447299987077713},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4392000138759613},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.41339999437332153}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7103999853134155},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.692799985408783},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.6316999793052673},{"id":"https://openalex.org/C2777611316","wikidata":"https://www.wikidata.org/wiki/Q39045282","display_name":"Streaming data","level":2,"score":0.5978999733924866},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5795000195503235},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5482000112533569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47279998660087585},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.447299987077713},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.42089998722076416},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C89198739","wikidata":"https://www.wikidata.org/wiki/Q3079880","display_name":"Data stream mining","level":2,"score":0.38580000400543213},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.38580000400543213},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.3650999963283539},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.3564000129699707},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C207968372","wikidata":"https://www.wikidata.org/wiki/Q310401","display_name":"k-means clustering","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i43.41022","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41022","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41022/44983","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.v40i43.41022","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41022","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41022/44983","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7138911033.pdf","grobid_xml":"https://content.openalex.org/works/W7138911033.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Many":[0],"real-world":[1],"applications":[2],"call":[3],"for":[4,174],"incorporating":[5],"fairness":[6],"constraints":[7],"into":[8,18,109],"the":[9,14,29,44,63,82,86,94,105,138,185,198,202,211],"k-center":[10,188],"clustering":[11,224],"problem,":[12,189],"where":[13,50,135,158],"dataset":[15],"is":[16,137,145],"partitioned":[17],"m":[19,175],"demographic":[20],"groups,":[21],"each":[22],"with":[23],"a":[24,47,56,60,69,76,110,169],"specified":[25],"upper":[26],"bound":[27],"on":[28,37,115],"number":[30],"of":[31,79,125,194,201,213],"centers":[32,92],"to":[33,154,183,209],"ensure":[34],"fairness.":[35],"Focusing":[36],"big":[38],"data":[39,51,156,159],"scenarios,":[40],"this":[41,165],"paper":[42],"addresses":[43],"problem":[45,114],"in":[46,55,162,222],"streaming":[48,71,83],"setting,":[49,166],"points":[52,80,160],"arrive":[53,161],"sequentially":[54],"continuous":[57],"stream.":[58],"Leveraging":[59],"structure":[61],"called":[62],"\u03bb-independent":[64],"center":[65],"set,":[66],"we":[67,89,150,167,205],"propose":[68],"one-pass":[70],"algorithm":[72,120,173],"that":[73,196,217],"first":[74],"computes":[75],"reserved":[77,95],"set":[78,97],"during":[81],"process.":[84],"In":[85,164],"post-streaming":[87],"process,":[88],"then":[90],"select":[91],"from":[93],"point":[96],"by":[98],"analyzing":[99],"three":[100],"possible":[101],"cases":[102],"and":[103,129,141,226],"transforming":[104],"most":[106],"complex":[107],"one":[108],"specially":[111],"constrained":[112],"vertex-cover":[113],"an":[116,122,191],"auxiliary":[117],"graph.":[118],"Our":[119],"achieves":[121],"approximation":[123,192],"ratio":[124,140,193],"5":[126],"+":[127,171],"?":[128,136,142],"memory":[130],"complexity":[131],"O(k":[132],"log":[133],"?),":[134],"aspect":[139],">":[143],"0":[144],"any":[146],"small":[147],"constant.":[148],"Furthermore,":[149],"extend":[151],"our":[152,214],"approach":[153],"semi-structured":[155],"streams,":[157],"groups.":[163],"present":[168],"(3":[170],"?)-approximation":[172],"=":[176],"2,":[177],"which":[178],"can":[179],"be":[180],"readily":[181],"adapted":[182],"solve":[184],"offline":[186],"fair":[187],"achieving":[190],"3":[195],"matches":[197],"current":[199],"state":[200],"art.":[203],"Lastly,":[204],"conduct":[206],"extensive":[207],"experiments":[208],"evaluate":[210],"performance":[212],"approaches,":[215],"demonstrating":[216],"they":[218],"outperform":[219],"existing":[220],"baselines":[221],"both":[223],"cost":[225],"runtime":[227],"efficiency.":[228]},"counts_by_year":[],"updated_date":"2026-03-20T20:54:20.808490","created_date":"2026-03-20T00:00:00"}