Sciweavers

Share
ICML
2009
IEEE

Partial order embedding with multiple kernels

12 years 6 months ago
Partial order embedding with multiple kernels
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order constraints arise naturally when modeling human perception of similarity. Our partial order framework enables the use of graph-theoretic tools to more efficiently produce the embedding, and exploit global structure within the constraint set. We present an embedding algorithm based on semidefinite programming, which can be parameterized by multiple kernels to yield a unified space from heterogeneous features.
Brian McFee, Gert R. G. Lanckriet
Added 17 Nov 2009
Updated 17 Nov 2009
Type Conference
Year 2009
Where ICML
Authors Brian McFee, Gert R. G. Lanckriet
Comments (0)
books