资源分类
》 资源 》论文》Adaptively Learning the Crowd Kernel

Adaptively Learning the Crowd Kernel

2020-02-27 | |  59 |   52 |   0

Abstract

We introduce an algorithm that, given n objects, learns a similarity matrix over all 图片.png pairs, from crowdsourced data alone. The algorithm samples responses to adaptively chosen triplet-based relative-similarity queries. Each query has the form “is object a more similar to b or to c?” and is chosen to be maximally informative given the preceding responses. The output is an embedding of the objects into Euclidean space (like MDS); we refer to this as the “crowd kernel.” SVMs reveal that the crowd kernel captures prominent and subtle features across a number of domains, such as “is striped” among neckties and “vowel vs. consonant” among letters.

上一篇：Beam Search based MAP Estimates for the Indian Buffet Process

下一篇：Better Algorithms for Selective Sampling

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...