0


基于距离模型的无监督秩排序

Unsupervised Rank Aggregation with Distance-Based Models
课程网址: http://videolectures.net/icml08_klementiev_ura/  
主讲教师: Alexandre Klementiev
开课单位: 伊利诺伊大学
开课时间: 2008-08-29
课程语种: 英语
中文简介:
当人们处理排名数据时,通常会出现有意义地组合排名的需要。尽管存在许多用于排名聚合的启发式和监督式学习方法,但是它们需要领域知识或监督的排名数据,这两者都是昂贵的获取。为了解决这些限制,我们提出了一个数学和算法框架,用于学习在没有监督的情况下聚合(部分)排名。我们为组合排列和组合前k个列表的情况实例化框架,并为后者提出新的度量。两种情景中的实验都证明了所提出的形式主义的有效性。
课程简介: The need to meaningfully combine sets of rankings often comes up when one deals with ranked data. Although a number of heuristic and supervised learning approaches to rank aggregation exist, they require domain knowledge or supervised ranked data, both of which are expensive to acquire. In order to address these limitations, we propose a mathematical and algorithmic framework for learning to aggregate (partial) rankings without supervision. We instantiate the framework for the cases of combining permutations and combining top-k lists, and propose a novel metric for the latter. Experiments in both scenarios demonstrate the effectiveness of the proposed formalism.
关 键 词: 排名数据; 形式主义; 监督式学习
课程来源: 视频讲座网
最后编审: 2020-07-13:yumf
阅读次数: 57