Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Authors:
- Erik D. DemaineEDErik D. Demaine
- MohammadTaghi HajiaghayiMHMohammadTaghi Hajiaghayi
- Anastasios SidiropoulosASAnastasios Sidiropoulos
- 27 August 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 21-34
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Uncertainty principles, extractors, and explicit embeddings of l2 into l12007
- On the impossibility of dimension reduction in l 1Journal of the ACM, 2005
- Embedding the diamond graph in Lp and dimension reduction in L1Geometric and Functional Analysis, 2004
- Very tight embeddings of subspaces of L p , 1 ? p < 2, into l p nGeometric and Functional Analysis, 2003
- A Geometric Approach to BetweennessSIAM Journal on Discrete Mathematics, 1998
- Extensions of Lipschitz mappings into a Hilbert space1984
- The dimension of almost spherical sections of convex bodiesActa Mathematica, 1977
- Monotone mapping of similarities into a general metric spaceJournal of Mathematical Psychology, 1974
- Nonmetric Multidimensional Scaling: A Numerical MethodPsychometrika, 1964
- Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric HypothesisPsychometrika, 1964