arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1708.07336cs.LGcs.IR
收藏

大规模线性二部排序的点对主动抽样

Active Sampling of Pairs and Points for Large-scale Linear Bipartite Ranking

National Taiwan University(国立台湾大学)

Wei-Yuan Shen, Hsuan-Tien Lin

摘要:

二分排序是一个基本的排序问题,它学习将相关的实例排在不相关的实例之前。二分排序的逐对方法构造了二次数量的对来解决问题,这对于大规模数据集是不可行的。逐点方法虽然更有效,但通常会导致较差的性能。也就是说,很难同时准确和有效地进行双方排名。在本文中,我们开发了一种新的主动抽样方案内的成对的方法进行有效的二分排名。该方案的灵感来自于主动学习,可以达到一个有竞争力的排名性能,而在训练过程中只关注许多对的一个小子集。此外,我们提出了一个通用的组合排名和分类(CRC)框架,以准确地进行二分排名。该框架统一了逐点和逐对方法,并且简单地基于将每个实例点视为伪对的想法。在14个真实大规模数据集上的实验表明,该算法与线性支持向量机相结合,在精度和效率上均优于现有的逐点排序和逐对排序方法.

英文摘要:

Bipartite ranking is a fundamental ranking problem that learns to order relevant instances ahead of irrelevant ones. The pair-wise approach for bi-partite ranking construct a quadratic number of pairs to solve the problem, which is infeasible for large-scale data sets. The point-wise approach, albeit more efficient, often results in inferior performance. That is, it is difficult to conduct bipartite ranking accurately and efficiently at the same time. In this paper, we develop a novel active sampling scheme within the pair-wise approach to conduct bipartite ranking efficiently. The scheme is inspired from active learning and can reach a competitive ranking performance while focusing only on a small subset of the many pairs during training. Moreover, we propose a general Combined Ranking and Classification (CRC) framework to accurately conduct bipartite ranking. The framework unifies point-wise and pair-wise approaches and is simply based on the idea of treating each instance point as a pseudo-pair. Experiments on 14 real-word large-scale data sets demonstrate that the proposed algorithm of Active Sampling within CRC, when coupled with a linear Support Vector Machine, usually outperforms state-of-the-art point-wise and pair-wise ranking approaches in terms of both accuracy and efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑