Traditional ranking systems are expected to sort items in the order of their relevance and thereby maximize their utility. In fair ranking, utility is complemented with fairness as an optimization goal. Recent work on fair ranking focuses on developing algorithms to optimize for fairness, given position-based exposure. In contrast, we identify the potential of outliers in a ranking to influence exposure and thereby negatively impact fairness. An outlier in a list of items can alter the examination probabilities, which can lead to different distributions of attention, compared to position-based exposure. We formalize outlierness in a ranking, show that outliers are present in realistic datasets, and present the results of an eye-tracking study, showing that users scanning order and the exposure of items are influenced by the presence of outliers. We then introduce OMIT, a method for fair ranking in the presence of outliers. Given an outlier detection method, OMIT improves fair allocation of exposure by suppressing outliers in the top-k ranking. Using an academic search dataset, we show that outlierness optimization leads to a fairer policy that displays fewer outliers in the top-k, while maintaining a reasonable trade-off between fairness and utility.
翻译:传统排名制度预计将按其相关性对项目进行分类,从而最大限度地发挥其效用。在公平的排名中,效用被作为优化目标的公平性加以补充。最近关于公平排名的工作侧重于开发算法,以优化公平性,考虑到基于位置的暴露情况。相反,我们确定在排名中外端人的潜力,以影响接触,从而对公平性产生不利影响。在一份项目清单中,外端人可以改变检查概率,这可能导致与基于位置的暴露相比不同关注分布。在排名中,我们正式确定异常性,表明外端人在现实数据集中存在,并展示了眼跟踪研究的结果,表明用户扫描顺序和物品的暴露受到外部人物的存在的影响。我们随后引入了OMIT,这是在外部人物在场时公平排序的一种方法。根据外部检测方法,OMIT通过抑制顶级的外部人物来改善接触的公平分配。我们使用学术搜索数据集,我们显示,异常性优化导致在顶端和顶端公平性之间显示更公平的政策,同时保持合理的公用性。