Learning Dissimilarities by Ranking: From SDP to QP

author: Hua Ouyang, College of Computing, Georgia Institute of Technology
published: Aug. 29, 2008,   recorded: July 2008,   views: 128

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

We consider the problem of learning dissimilarities between points via formulations which preserve a specified ordering between points rather than the numerical values of the dissimilarities. Dissimilarity ranking (d-ranking) learns from instances like "A is more similar to B than C is to D" or "The distance between E and F is larger than that between G and H". Three formulations of d-ranking problems are presented and new algorithms are presented for two of them, one by semidefinite programming (SDP) and one by quadratic programming (QP). Among the novel capabilities of these approaches are out-of-sample prediction and scalability to large problems.

See Also:

Download slides icon Download slides: icml08_ouyang_ldr_01.pdf (714.7┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Pastro Park, August 31, 2008 at 6:38 a.m.:

I can't hear ant sound.
Is it my computer problem
or your casting problem?

Write your own review or comment:

make sure you have javascript enabled or clear this field: