Skip to main content

Elliptical Ordinal Embedding

  • Conference paper
  • First Online:
Discovery Science (DS 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12986))

Included in the following conference series:

Abstract

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form ”item j is closer to item i than item k”. Typically, each object is mapped onto a point vector in a low dimensional metric space. We argue that mapping to a density instead of a point vector provides some interesting advantages, including an inherent reflection of the uncertainty about the representation itself and its relative location in the space. Indeed, in this paper, we propose to embed each object as a Gaussian distribution. We investigate the ability of these embeddings to capture the underlying structure of the data while satisfying the constraints, and explore properties of the representation. Experiments on synthetic and real-world datasets showcase the advantages of our approach. In addition, we illustrate the merit of modelling uncertainty, which enriches the visual perception of the mapped objects in the space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Let us define the centroid \(\bar{x}\) as \(\bar{x} = \frac{1}{n} \sum ^n_{i=1}x_i\), then the centroid size \(S_X\) is \(S_X = ( \frac{1}{n}\sum ^n_{i=1}(\bar{x}-x_i)^2)^{1/2}\), provided we ignore the trivial case in which all points coincide.

  2. 2.

    https://scikit-learn.org/.

References

  1. Agarwal, S., Wills, J., Cayton, L., Lanckriet, G., Kriegman, D., Belongie, S.: Generalized non-metric multidimensional scaling. In: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 11–18 (2007)

    Google Scholar 

  2. Beran, R.: Minimum Hellinger distance estimates for parametric models. Ann. Stat. 5(3), 445–463 (1977)

    MathSciNet  MATH  Google Scholar 

  3. Diallo, A., Fürnkranz, J.: Elliptical ordinal embedding. arXiv preprint (2021)

    Google Scholar 

  4. Dryden, I.L., Mardia, K.V.: Statistical shape analysis with applications in R. Wiley Series in Probability and Statistics, vol. 995. Wiley, New York (2016)

    Google Scholar 

  5. Frogner, C., Zhang, C., Mobahi, H., Araya, M., Poggio, T.A.: Learning with a Wasserstein loss. In: Advances in Neural Information Processing Systems 28 (2015)

    Google Scholar 

  6. Haghiri, S., Vankadara, L.C., von Luxburg, U.: Large scale representation learning from triplet comparisons. arXiv preprint arXiv:1912.01666 (2019)

  7. Jamieson, K, G., Nowak, R, D.: Low-dimensional embedding using adaptively selected ordinal data. In: Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing. IEEE (2011)

    Google Scholar 

  8. Kleindessner, M., von Luxburg, U.: Kernel functions based on triplet comparisons. In: Advances in Neural Information Processing Systems 30 (2017)

    Google Scholar 

  9. LeCun, Y., Chopra, S., Hadsell, R., Ranzato, M., Huang, F.: A tutorial on energy-based learning. Predict. Struct. Data 1(0) (2006)

    Google Scholar 

  10. McFee, B.: More like this: machine learning approaches to music similarity. Ph.D. thesis, University of California, San Diego (2012)

    Google Scholar 

  11. Muzellec, B., Cuturi, M.: Generalizing point embeddings using the Wasserstein space of elliptical distributions. In: Advances in Neural Information Processing System 31, pp. 10258–10269 (2018)

    Google Scholar 

  12. Olkin, I., Pukelsheim, F.: The distance between two random vectors with given dispersion matrices. Linear Algebra Appl. 48, 257–263 (1982)

    Article  MathSciNet  Google Scholar 

  13. Stewart, N., Brown, G.D., Chater, N.: Absolute identification by relative judgment. Psychol. Rev. 112(4), 881 (2005)

    Article  Google Scholar 

  14. Van Der Maaten, L., Weinberger, K.: Stochastic triplet embedding. In: Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, pp. 1–6. IEEE (2012)

    Google Scholar 

  15. Wilber, M.J., Kwak, I.S., Belongie, S.J.: Cost-effective hits for relative similarity comparisons. In: Proceedings of the 2nd AAAI conference on Human Computation and Crowdsourcing (HCOMP) (2014)

    Google Scholar 

Download references

Acknowledgements

This work has been supported by the German Research Foundation as part of the Research Training Group Adaptive Preparation of Information from Heterogeneous Sources (AIPHES) under grant No. GRK 1994/1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aïssatou Diallo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Diallo, A., Fürnkranz, J. (2021). Elliptical Ordinal Embedding. In: Soares, C., Torgo, L. (eds) Discovery Science. DS 2021. Lecture Notes in Computer Science(), vol 12986. Springer, Cham. https://doi.org/10.1007/978-3-030-88942-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88942-5_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88941-8

  • Online ISBN: 978-3-030-88942-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics