We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...
A comparison-based search algorithm lets a user find a target item t in a database by answering queries of the form, "Which of items i and j is closer to t?" Instead of formulating an explicit query (such as one or several keywords), the user navigates tow ...
In this thesis we study a problem of searching in a space of objects using comparisons. To navigate through the space to the target object t, we ask a sequence of questions of the form ``which object i or j is closer to t?'' for which we observe no ...