题名 | Fair Top-k Query on Alpha-Fairness |
作者 | |
DOI | |
发表日期 | 2024-05-16
|
ISSN | 1063-6382
|
ISBN | 979-8-3503-1716-9
|
会议录名称 | |
会议日期 | 13-16 May 2024
|
会议地点 | Utrecht, Netherlands
|
摘要 | The traditional top-k query was proposed to obtain a small subset from the database according to the user preference, which is explicitly expressed as a ranking scheme (i.e., utility function). However, a poorly-designed utility function may create discrimination, which in turn may cause harm to minority groups, e.g., women and ethnic minorities, and thus, fairness is becoming increasingly important in many situations, e.g., hiring and admission decisions. Motivated by this, we study fair ranking to alleviate discrimination. We design a fairness model, called α-fairness, to quantify the fairness of utility functions. We propose an efficient exact framework with a basic implementation and an improved implementation to find the fairest utility function with the minimum modification penalty. We conducted extensive experiments on both real and synthetic datasets to demonstrate our effectiveness and efficiency compared with the prior studies. |
学校署名 | 其他
|
相关链接 | [IEEE记录] |
收录类别 | |
引用统计 | |
成果类型 | 会议论文 |
条目标识符 | http://sustech.caswiz.com/handle/2SGJ60CL/803374 |
专题 | 南方科技大学 |
作者单位 | 1.The Hong Kong University of Science and Technology 2.Individual 3.Shenzhen Institute of Computing Sciences 4.Southern University of Science and Technology |
推荐引用方式 GB/T 7714 |
Hao Liu,Raymond Chi-Wing Wong,Zheng Zhang,et al. Fair Top-k Query on Alpha-Fairness[C],2024.
|
条目包含的文件 | 条目无相关文件。 |
|
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论