## Algorithmic embeddings

##### Author(s)

Bădoiu, Mihai, 1978-
DownloadFull printable version (12.15Mb)

##### Other Contributors

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

##### Advisor

Piotr Indyk.

##### Terms of use

##### Metadata

Show full item record##### Abstract

We present several computationally efficient algorithms, and complexity results on low distortion mappings between metric spaces. An embedding between two metric spaces is a mapping between the two metric spaces and the distortion of the embedding is the factor by which the distances change. We have pioneered theoretical work on relative (or approximation) version of this problem. In this setting, the question is the following: for the class of metrics C, and a host metric M', what is the smallest approximation factor a > 1 of an efficient algorithm minimizing the distortion of an embedding of a given input metric M E C into M'? This formulation enables the algorithm to adapt to a given input metric. In particular, if the host metric is "expressive enough" to accurately model the input distances, the minimum achievable distortion is low, and the algorithm will produce an embedding with low distortion as well. This problem has been a subject of extensive applied research during the last few decades. However, almost all known algorithms for this problem are heuristic. As such, they can get stuck in local minima, and do not provide any global guarantees on solution quality. We investigate several variants of the above problem, varying different host and target metrics, and definitions of distortion. (cont.) We present results for different types of distortion: multiplicative versus additive, worst-case versus average-case and several types of target metrics, such as the line, the plane, d-dimensional Euclidean space, ultrametrics, and trees. We also present algorithms for ordinal embeddings and embedding with extra information.

##### Description

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. Includes bibliographical references (p. 233-242).

##### Date issued

2006##### Department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science##### Publisher

Massachusetts Institute of Technology

##### Keywords

Electrical Engineering and Computer Science.