Partial Order Embedding with Multiple Kernels
Abstract
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 yielding a unified space from heterogeneous features.
Cite
Text
McFee and Lanckriet. "Partial Order Embedding with Multiple Kernels." International Conference on Machine Learning, 2009. doi:10.1145/1553374.1553467Markdown
[McFee and Lanckriet. "Partial Order Embedding with Multiple Kernels." International Conference on Machine Learning, 2009.](https://mlanthology.org/icml/2009/mcfee2009icml-partial/) doi:10.1145/1553374.1553467BibTeX
@inproceedings{mcfee2009icml-partial,
title = {{Partial Order Embedding with Multiple Kernels}},
author = {McFee, Brian and Lanckriet, Gert R. G.},
booktitle = {International Conference on Machine Learning},
year = {2009},
pages = {721-728},
doi = {10.1145/1553374.1553467},
url = {https://mlanthology.org/icml/2009/mcfee2009icml-partial/}
}