ICML-Approximate Group Fairness for Clustering

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Approximate Group Fairness for Clustering

            Bo Li 1 Lijun Li 2 Ankang Sun 3 Chenhao Wang 4 * Yingfan Wang 5

             Abstract                in unsupervised learning – specifically, centroid clustering.
   We incorporate group fairness into the algorithmic     A canonical clustering problem is described as: given a
   centroid clustering problem, where k centers are      metric space X with distance measure d : X × X → R+ ∪
   to be located to serve n agents distributed in a      ...

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：Approximate Clustering Fairness Cluster Approx