Adaptively Learning the Crowd Kernel

Details Adaptively Learning the Crowd Kernel Adaptively Learning the Crowd Kernel

2011-05-05

arxiv.org/abs/1105.1033v2

Computer Science

Learning

9 pages, 7 figures, Accepted to the 28th International Conference on Machine Learning (ICML), 2011

Scientific paper

We introduce an algorithm that, given n objects, learns a similarity matrix over all n^2 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.

Affiliated with

Also associated with

No associations

Rating

Adaptively Learning the Crowd Kernel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptively Learning the Crowd Kernel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptively Learning the Crowd Kernel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690595