Skip to main content

Hyperbolic Ordinal Embedding.

Suzuki, A., Wang, J., Tian, F., Nitanda, A. and Yamanishi, K., 2019. Hyperbolic Ordinal Embedding. In: ACML 2019: 11th Asian Conference on Machine Learning, 17-19 November 2019, Nagoya, Japan.

Full text available as:

[img]
Preview
PDF
hyperbolic ordinal embedding - ACML.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial.

471kB

Official URL: http://www.acml-conf.org/2019/

Abstract

Given ordinal relations such as the object i is more similar to j than k is to l, ordinal embedding is to embed these objects into a low-dimensional space with all ordinal constraints preserved. Although existing approaches have preserved ordinal relations in Euclidean space, whether Euclidean space is compatible with true data structure is largely ignored, although it is essential to effective embedding. Since real data often exhibit hierarchical structure, it is hard for Euclidean space approaches to achieve effective embeddings in low dimensionality, which incurs high computational complexity or overfitting. In this paper we propose a novel hyperbolic ordinal embedding (HOE) method to embed objects in hyperbolic space. Due to the hierarchy-friendly property of hyperbolic space, HOE can effectively capture the hierarchy to achieve embeddings in an extremely low-dimensional space. We have not only theoretically proved the superiority of hyperbolic space and the limitations of Euclidean space for embedding hierarchical data, but also experimentally demonstrated that HOE significantly outperforms Euclidean-based methods.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Ordinal Embedding, Hyperbolic Space, Hierarchical Structure, Low-dimensionality
Group:Faculty of Science & Technology
ID Code:33652
Deposited By: Unnamed user with email symplectic@symplectic
Deposited On:10 Mar 2020 12:19
Last Modified:10 Mar 2020 12:19

Downloads

Downloads per month over past year

More statistics for this item...
Repository Staff Only -