Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics

ACM Transactions on Algorithms

Volumn 4, Issue 4, 2008, Pages

  Alon, Noga ^a   Bdoiu, Mihai ^b   Demaine, Erik D ^c,f   Farach Colton, Martin ^d,g   Hajiaghayi, Mohammadtaghi ^e,h   Sidiropoulos, Anastasios ^c,f  

^a TEL AVIV UNIVERSITY   (Israel)

^b GOOGLE INC   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d RUTGERS UNIVERSITY   (United States)

^e AT AND T LABS RESEARCH   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^g RUTGERS UNIVERSITY   (United States)

^h AT AND T LABS RESEARCH   (United States)

Author keywords

Distortion; Metrics; Ordinal embedding; Relaxation

Indexed keywords

DISTORTION; METRICS; ORDINAL EMBEDDING; RELAXATION; ULTRAMETRICS;

APPROXIMATION ALGORITHMS;

EID: 50849083491     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1383369.1383377     Document Type: Article

References (35)

1. AGARWALA. R., BAFNA, V., FARACH, M., PATERSON, M., AND THORUP, M. 1999. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM J. Comput. 283, 1073-1085.
2. ALON, N. 1995. Tools from higher algebra. In Handbook of Combinatorics, R. L. Graham, M. Grötschel, and L. Lovász, Eds. Vol. 2. MIT Press, Chap. 32. 1749-1783.
3. ALON, N., FRANKL, P., AND RÖDL, V. 1985. Geometrical realization of set systems and probabilistic communication complexity. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science. Portland, OR, 277-280.
4. BABILON, R., MATOUŠEK, J., MAXOVÁ , J., AND VALTR, P. 2003. Low-distortion embeddings of trees. J. Graph Algor. Appl. 7, 4, 399-409.
5. BǍDOIU, M., DHAMDHERE, K., GUPTA, A., RABINOVICH, Y., RAECKE, H., RAVI, R., AND SIDIROPOULOS, A. 2005. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. Vancouver, British Columbia, Canada.
6. BARTAL, Y., AND MENDEL, M. 2004. Dimension reduction for ultrametrics. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms. 664-665.
7. BARTHELEMY, J.-P., AND GUENOCHE, A. 1991. Trees and Proximity Representations. John Wiley.
8. BILU, Y., AND LINIAL, N. 2004. Monotone maps, sphericity and bounded second eigenvalue. arXiv:math.CO/0401293.
9. BOURGAIN, J. 1985. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math. 52, 1-2, 46-52.
10. 1. In Proceedings of the 44th Symposium on Foundations of Computer Science, 514-523.
11. BǍDOIU, M. 2003. Approximation algorithm for embedding metrics into a two-dimensional space. In Procedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 434-443.
12. BǍDOIU, M., DEMAINE, E. D., HAJIAGHAYI, M., AND INDYK, P. 2004. Low-dimensional embedding with extra information. In Proceedings of the 20th Annual ACM Symposium on Computational Geometry. Brooklyn, NY.
13. CHOR. B., AND SUDAN, M. 1998. A geometric approach to betweennes. SIAM J. Discrete Math. 114, 511-523.
14. CUNNINGHAM, J. P., AND SHEPARD, R. N. 1974. Monotone mapping of similarities into a general metric space. J. Math. Psych. 11, 335-364.
15. ERDOS, P., AND SACHS. H. 1963. Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12, 251-257.
16. FARACH, M., AND KANNAN, S. 1999. Efficient algorithms for inverting evolution. J. ACM 46, 4, 437-449.
17. FARACH, M., KANNAN, S., AND WARNOW, T. 1995. A robust model for finding optimal evolutionary trees. Algorithmica 13, 1-2, 155-179.
18. GUPTA, A. 2000. Embedding tree metrics into low-dimensional Euclidean spaces. Discrete Comput. Geom. 24, 1, 105-116.
19. HARDING. E. F. 1966/1967. The number of partitions of a set of Npoints in kdimensions induced by hyperplanes. Proceedings of the Edinburgh Mathematical Society, Series II 15285-289.
20. HÅSTAD, J., IVANSSON, L., AND LAGERGREN, J. 2003. Fitting points on the real line and its application to RH mapping. J. Algor. 49, 62, 42-62.
21. HOLMAN, W. 1972. The relation between hierarchical and euclidean models for psychological distances. Psychometrika 37, 4, 417-423.
22. INDYK, P., AND MATOUŠEK, J. 2004. Low-distortion embeddings of finite metric spaces. In Handbook of Discrete and Computational Geometry, 2nd Ed., J. E. Goodman and J. O'Rourke, Eds. CRC Press, Chap. 8, 177-196.
23. IVANSSON, L. 2000. Computational aspects of radiation hybrid. Ph.D. thesis, Department of Numerical Analysis and Computer Science, Royal Institute of Technology.
24. JOHNSON, W. B., AND LINDENSTRAUSS, J. 1984. Extensions of lipshitz mapping into hilbert space. Contemp. Math. 26, 189-206.
25. KRUSKAL, J. B. 1964a. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29, 1-28.
26. KRUSKAL, J. B. 1964b. Non-metric multidimensional scaling. Psychometrika 29, 115-129.
27. l. Geome. Funct. Anal. 14, 4, 745-747.
28. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 2, 215-245.
29. MATOUŠEK, J. 1990. Bi-Lipschitz embeddings into low-dimensional Euclidean spaces. Commentationes Mathematicae Universitatis Carolinae 31, 3, 589-600.
30. p spaces. Israel Journal of Mathematics 102, 189-197.
31. OPATRNY, J. 1979. Total ordering problem. SIAM J. Comput. 8, 111-114.
32. SHAH, R., AND FARACH-COLTON, M. 2004. On the complexity of ordinal clustering. J. Classification, To appear.
33. SHEPARD. R. N. 1962. Multidimensional scaling with unknown distance function I. Psychometrika 27125-140.
34. TORGERSON, W. S. 1952. Multidimensional scaling I: Theory and method. Psychometrika 17, 4, 401-414.
35. WARREN, H. E. 1968. Lower bounds for approximation by nonlinear manifolds. Trans. Amer. Math. Soc. 133, 167-178.