{"id":"https://openalex.org/W7129006488","doi":"https://doi.org/10.71448/bcds2564-2","title":"Differentially Private Universal Coresets for ( \u03b1 , \u03b2 ) -Fair k -Median and k -Means Clustering","display_name":"Differentially Private Universal Coresets for ( \u03b1 , \u03b2 ) -Fair k -Median and k -Means Clustering","publication_year":2025,"publication_date":"2025-12-30","ids":{"openalex":"https://openalex.org/W7129006488","doi":"https://doi.org/10.71448/bcds2564-2"},"language":null,"primary_location":{"id":"doi:10.71448/bcds2564-2","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2564-2","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.71448/bcds2564-2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126110902","display_name":"Iftikhar Ahmad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iftikhar Ahmad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126098478","display_name":"Wang Zu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang Zu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.77950405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"4","first_page":"22","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.6500999927520752,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.6500999927520752,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.1242000013589859,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.029600000008940697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6407999992370605},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5361999869346619},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5006999969482422},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4717000126838684},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4104999899864197},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.398499995470047},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.39730000495910645},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.3822000026702881},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.3716000020503998}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6407999992370605},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5361999869346619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5151000022888184},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5006999969482422},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4104999899864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40119999647140503},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3716000020503998},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34540000557899475},{"id":"https://openalex.org/C61224824","wikidata":"https://www.wikidata.org/wiki/Q2260434","display_name":"Mixture model","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.3370000123977661},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.3102000057697296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3021000027656555},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.2985000014305115},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2540000081062317},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25270000100135803},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.71448/bcds2564-2","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2564-2","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.71448/bcds2564-2","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2564-2","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7346329689025879,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Fair":[0],"clustering":[1,44,216],"with":[2,154],"(":[3],"\u03b1":[4],",":[5],"\u03b2":[6],")":[7],"-proportionality":[8],"constraints":[9,67],"requires":[10],"every":[11],"cluster":[12],"to":[13,164,193,224],"satisfy":[14],"lower":[15],"and":[16,51,73,82,98,102,120,141,183,197,206,217],"upper":[17],"bounds":[18],"on":[19,176],"the":[20,34,61,130,134,147,177,191,225],"representation":[21],"of":[22,108],"each":[23],"sensitive":[24,62,227],"group.":[25],"Recent":[26],"universal-coreset":[27],"results":[28],"enable":[29],"scalable":[30],"optimization":[31],"by":[32,127,138],"compressing":[33],"dataset":[35],"into":[36],"a":[37,76,87,113,124,165],"small":[38,77],"weighted":[39],"subset":[40],"that":[41,64,146,174],"preserves":[42,157],"constrained":[43,158],"costs":[45,159],"simultaneously":[46],"for":[47,90,95,160],"all":[48,52,161],"center":[49],"sets":[50],"feasible":[53],"group-cardinality":[54],"(coloring)":[55],"constraints.":[56],"In":[57],"many":[58],"applications,":[59],"however,":[60],"attributes":[63],"motivate":[65],"fairness":[66],"also":[68],"require":[69],"formal":[70],"privacy":[71,172,199],"protection,":[72],"releasing":[74],"even":[75],"coreset":[78,116,126,181],"can":[79],"leak":[80],"membership":[81],"group":[83],"information.":[84],"We":[85,144,188],"propose":[86],"modular":[88],"framework":[89,106],"differentially":[91],"private":[92,152],"universal":[93,211],"coresets":[94,212],"(\u03b1,\u03b2)-fair":[96],"k-median":[97],"k-means":[99],"in":[100],"metric":[101,178],"Euclidean":[103],"spaces.":[104],"The":[105,208],"consists":[107],"two":[109],"stages:":[110],"(i)":[111],"construct":[112],"randomized":[114],"\u03b7/2-universal":[115],"via":[117,195],"random":[118],"sampling":[119],"reweighting;":[121],"(ii)":[122],"release":[123],"privatized":[125],"perturbing":[128],"only":[129],"weight":[131],"vector":[132],"using":[133,203],"Gaussian":[135],"mechanism,":[136],"followed":[137],"post-processing":[139],"(nonnegativity":[140],"mass":[142],"renormalization).":[143],"prove":[145],"released":[148],"summary":[149],"is":[150],"(\u03b5,\u03b4)-differentially":[151],"and,":[153],"high":[155],"probability,":[156],"(C,M)":[162],"up":[163],"multiplicative":[166],"(1\u00b1\u03b7)":[167],"factor":[168],"plus":[169],"an":[170,184],"additive":[171],"term":[173],"depends":[175],"diameter":[179],"bound,":[180],"size,":[182],"\u21132":[185],"weight-sensitivity":[186],"parameter.":[187],"further":[189],"extend":[190],"method":[192],"streaming":[194],"merge-and-reduce":[196],"analyze":[198],"under":[200],"continual":[201],"observation":[202],"advanced":[204],"composition":[205],"amplification-by-subsampling.":[207],"resulting":[209],"DP":[210],"allow":[213],"multi-query":[214],"fair":[215],"interactive":[218],"constraint":[219],"tuning":[220],"without":[221],"repeated":[222],"access":[223],"raw":[226],"dataset.":[228]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-02-17T00:00:00"}