We study the problem of finding low-cost fair clusterings in data where each data point may belong to many protected groups. Our work significantly generalizes the seminal work of Chierichetti et al. (NIPS 2017) as follows. 1. We allow the user to specify the parameters that define fair ...
We demonstrate the use of our technique by obtaining substantially improved results for two different on-line problems. CCF-A 447 被引用 · 1 笔记 引用 Fair Algorithms for Clustering Suman K. BeraDeeparnab ChakrabartyNicolas FloresMaryam Negahbani arXiv: Data Structures and Algorithms Cornell ...
Bera SK, Chakrabarty D, Flores N, Negahbani M (2019) Fair algorithms for clustering. In: NeurIPS, pp 4955–4966 Breunig MM, Kriegel HP, Ng RT, Sander J (2000) Lof: identifying density-based local outliers. In: SIGMOD, pp 93–104 Chandola V, Banerjee A, Kumar V (2007) Outlier detec...
They then applied k-means or k-median algorithms to the set of fairlets. A majority of follow-up studies since then have taken a combinatorial approach to search for clustering with a balance closer to the desired level [7], [16]. However, the computational complexity of such approaches ...
Glaucoma is the leading cause of irreversible blindness globally. Research indicates a disproportionate impact of glaucoma on racial and ethnic minorities. Existing deep learning models for glaucoma detection might not achieve equitable performance acros
The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications. When applied to vertex-colored graphs (the colors representing subgroups), standard algorithms for the NP...
TB0 (Depricated: time bucket refrence for micromegas) EntTB (position in time buckets for detector entrance) ATPRATask Has options for RANSAC, Hierarchical Clustering, and Houghs algorithms for track finding. record of hits (TClonesArray of AtEvent) -> record of reconstructed tracks (ATTrack)...
2、We have retested the results of some algorithms, which may differ from those in the TFB paper. You can find the hyperparameters we ultimately selected for each algorithm on each dataset in the scripts folder, and their corresponding algorithm test results can be found on the OpenTS! 🚩...
Sometimes, the devices can’t connect well or analyse data in real-time because the algorithms (rules for processing data) are not ready yet. This can be made worse by not having the technical knowledge needed to use these devices effectively. 2.3 The appropriate use of technology solutions ...
Algorithms for fair k-clustering with multiple protected attributes We study fair center based clustering problems. In an influential paper, Chierichetti, Kumar, Lattanzi and Vassilvitskii (NIPS 2017) consider the problem o... M Bhm,A Fazzone,S Leonardi,... - 《Oper.res.lett》 被引量: 0发...