学习如何从严重扰动的统计数据中排序-有向图聚类方法
Learning how to rank from heavily perturbed statistics - digraph clustering approach
摘要:
排序是机器学习中最基本的问题之一,在计算机科学的许多分支中都有应用,例如:信息检索系统,推荐系统,机器翻译和计算生物学。基于可能冲突的偏好对对象进行排序是投票研究和社会选择理论中的一个核心问题。在本文中,我们提出了一个新的简单的组合排名算法,适用于基于偏好的设置。我们将这种新的算法应用到众所周知的情况下,由多数投票模型的偏好锦标赛的边缘。它优于现有的方法时,它不能假设存在足够好的质量的全球排名,并应用组合技术,还没有被用于排名的上下文中。实验表明,新算法优于现有的方法,也超过了这些设计来处理严重扰动的统计。通过将我们的技术与\cite{mohri}中提出的技术相结合,我们得到了一个纯粹的组合算法,正确回答了大多数查询的异构情况下,其中的偏好锦标赛是只有本地的质量好,但不一定是伪传递的。作为我们的方法的副产品,我们得到的算法解决有向种植分区模型的聚类问题。据我们所知,这是第一个纯粹的组合算法解决这个问题。
英文摘要:
Ranking is one of the most fundamental problems in machine learning with applications in many branches of computer science such as: information retrieval systems, recommendation systems, machine translation and computational biology. Ranking objects based on possibly conflicting preferences is a central problem in voting research and social choice theory. In this paper we present a new simple combinatorial ranking algorithm adapted to the preference-based setting. We apply this new algorithm to the well-known scenario where the edges of the preference tournament are determined by the majority-voting model. It outperforms existing methods when it cannot be assumed that there exists global ranking of good enough quality and applies combinatorial techniques that havent been used in the ranking context before. Performed experiments show the superiority of the new algorithm over existing methods, also over these that were designed to handle heavily perturbed statistics. By combining our techniques with those presented in \cite{mohri}, we obtain a purely combinatorial algorithm that answers correctly most of the queries in the heterogeneous scenario, where the preference tournament is only locally of good quality but is not necessarily pseudotransitive. As a byproduct of our methods, we obtain the algorithm solving clustering problem for the directed planted partition model. To the best of our knowledge, it is the first purely combinatorial algorithm tackling this problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。