English

Cost-Effective HITs for Relative Similarity Comparisons

Computer Vision and Pattern Recognition 2014-04-15 v1 Machine Learning

Abstract

Similarity comparisons of the form "Is object a more similar to b than to c?" are useful for computer vision and machine learning applications. Unfortunately, an embedding of nn points is specified by n3n^3 triplets, making collecting every triplet an expensive task. In noticing this difficulty, other researchers have investigated more intelligent triplet sampling techniques, but they do not study their effectiveness or their potential drawbacks. Although it is important to reduce the number of collected triplets, it is also important to understand how best to display a triplet collection task to a user. In this work we explore an alternative display for collecting triplets and analyze the monetary cost and speed of the display. We propose best practices for creating cost effective human intelligence tasks for collecting triplets. We show that rather than changing the sampling algorithm, simple changes to the crowdsourcing UI can lead to much higher quality embeddings. We also provide a dataset as well as the labels collected from crowd workers.

Keywords

Cite

@article{arxiv.1404.3291,
  title  = {Cost-Effective HITs for Relative Similarity Comparisons},
  author = {Michael J. Wilber and Iljung S. Kwak and Serge J. Belongie},
  journal= {arXiv preprint arXiv:1404.3291},
  year   = {2014}
}

Comments

7 pages, 7 figures

R2 v1 2026-06-22T03:49:20.214Z