{"id":"https://openalex.org/W4416017981","doi":"https://doi.org/10.1145/3746252.3761320","title":"FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance","display_name":"FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance","publication_year":2025,"publication_date":"2025-11-08","ids":{"openalex":"https://openalex.org/W4416017981","doi":"https://doi.org/10.1145/3746252.3761320"},"language":null,"primary_location":{"id":"doi:10.1145/3746252.3761320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3746252.3761320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111162443","display_name":"Minh Vuong","orcid":"https://orcid.org/0009-0004-0274-9936"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Minh Phu Vuong","raw_affiliation_strings":["Texas State Universtiy, San Marcos, TX, USA"],"raw_orcid":"https://orcid.org/0009-0004-0274-9936","affiliations":[{"raw_affiliation_string":"Texas State Universtiy, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101974021","display_name":"Young Ju Lee","orcid":"https://orcid.org/0000-0003-3365-9031"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Young-Ju Lee","raw_affiliation_strings":["Texas State University, San Marcos, TX, USA"],"raw_orcid":"https://orcid.org/0000-0003-3365-9031","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010639862","display_name":"Iv\u00e1n Ojeda-Ruiz","orcid":"https://orcid.org/0000-0003-3248-6271"},"institutions":[{"id":"https://openalex.org/I177898655","display_name":"Lamar University","ror":"https://ror.org/008ms5s18","country_code":"US","type":"education","lineage":["https://openalex.org/I177898655"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iv\u00e1n Ojeda-Ruiz","raw_affiliation_strings":["Lamar University, Beaumont, TX, USA"],"raw_orcid":"https://orcid.org/0000-0003-3248-6271","affiliations":[{"raw_affiliation_string":"Lamar University, Beaumont, TX, USA","institution_ids":["https://openalex.org/I177898655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115666594","display_name":"Chul-Ho Lee","orcid":"https://orcid.org/0000-0002-4778-8996"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chul-Ho Lee","raw_affiliation_strings":["Texas State University, San Marcos, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-4778-8996","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2941146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2935","last_page":"2944"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.2671999931335449,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.2671999931335449,"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.21220000088214874,"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"}},{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.06400000303983688,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision 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.7423999905586243},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5551000237464905},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.510200023651123},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.436599999666214},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.40639999508857727},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.3885999917984009},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.36489999294281006},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.36250001192092896},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.36059999465942383}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7423999905586243},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5551000237464905},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5128999948501587},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4422999918460846},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.436599999666214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43529999256134033},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.40639999508857727},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.3885999917984009},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.36489999294281006},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.36059999465942383},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.35010001063346863},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.3495999872684479},{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.3425999879837036},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.3409000039100647},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3343000113964081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3305000066757202},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31130000948905945},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.30559998750686646},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.28450000286102295},{"id":"https://openalex.org/C2989065042","wikidata":"https://www.wikidata.org/wiki/Q7378971","display_name":"Algebraic properties","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2612000107765198},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.25679999589920044},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3746252.3761320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3746252.3761320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5901916128","display_name":null,"funder_award_id":"IIS-2209921, CNS-2209922, DMS-2208499","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G723412441","display_name":null,"funder_award_id":"20228530050030","funder_id":"https://openalex.org/F4320335199","funder_display_name":"Korea Institute of Energy Technology Evaluation and Planning"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320335199","display_name":"Korea Institute of Energy Technology Evaluation and Planning","ror":"https://ror.org/02zq38y32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1506342804","https://openalex.org/W1866618235","https://openalex.org/W1975982181","https://openalex.org/W2014352947","https://openalex.org/W2052478943","https://openalex.org/W2058871925","https://openalex.org/W2085988980","https://openalex.org/W2100960835","https://openalex.org/W2121947440","https://openalex.org/W2132914434","https://openalex.org/W2137137397","https://openalex.org/W2161494102","https://openalex.org/W2997608034","https://openalex.org/W3016918255","https://openalex.org/W3035335952","https://openalex.org/W3094504436","https://openalex.org/W3117178429","https://openalex.org/W3176611929","https://openalex.org/W3192448376","https://openalex.org/W3210658351","https://openalex.org/W4213156298","https://openalex.org/W4383172123"],"related_works":[],"abstract_inverted_index":{"Due":[0],"to":[1,41,82,140,146,156,185,190],"the":[2,16,26,30,43,56,68,74,118,158,166],"growing":[3],"concern":[4],"about":[5],"unsavory":[6],"behaviors":[7],"of":[8,18,32,45,58,70,120,160],"machine":[9],"learning":[10],"models":[11],"toward":[12],"certain":[13],"demographic":[14],"groups,":[15],"notion":[17,119],"'fairness'":[19],"has":[20],"recently":[21],"drawn":[22],"much":[23],"attention":[24],"from":[25],"community,":[27],"thereby":[28],"motivating":[29],"study":[31],"fairness":[33,84,125],"in":[34,47,73],"graph":[35,38,49,88,106,130,193],"clustering.":[36,162],"Fair":[37],"clustering":[39,89,107,181,194],"aims":[40],"partition":[42],"set":[44],"nodes":[46,143],"a":[48,102,112,150],"into":[50,86],"k":[51,147],"disjoint":[52],"clusters":[53],"such":[54,123],"that":[55,71,124,144,176],"proportion":[57,69],"each":[59,63],"protected":[60],"group":[61,72],"within":[62],"cluster":[64],"is":[65,133,154],"consistent":[66],"with":[67],"entire":[75],"dataset.":[76],"It":[77,109],"is,":[78],"however,":[79],"computationally":[80,103],"challenging":[81],"incorporate":[83],"constraints":[85,126],"existing":[87],"algorithms,":[90],"particularly":[91],"for":[92],"large":[93],"graphs.":[94],"To":[95],"address":[96],"this":[97,137],"problem,":[98],"we":[99],"propose":[100],"FairAD,":[101],"efficient":[104],"fair":[105,161,180,192],"method.":[108],"first":[110],"constructs":[111],"new":[113],"affinity":[114,138],"matrix":[115,139],"based":[116],"on":[117,136,165],"algebraic":[121],"distance":[122],"are":[127],"imposed.":[128],"A":[129],"coarsening":[131],"process":[132],"then":[134],"performed":[135],"find":[141],"representative":[142],"correspond":[145],"clusters.":[148],"Finally,":[149],"constrained":[151],"minimization":[152],"problem":[153],"solved":[155],"obtain":[157],"solution":[159],"Experiment":[163],"results":[164],"modified":[167],"stochastic":[168],"block":[169],"model":[170],"and":[171],"six":[172],"public":[173],"datasets":[174],"show":[175],"FairAD":[177],"can":[178],"achieve":[179],"while":[182],"being":[183],"up":[184],"40":[186],"times":[187],"faster":[188],"compared":[189],"state-of-the-art":[191],"algorithms.":[195]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-08T00:00:00"}