Uniqueness of ordinal embedding
published: July 15, 2014, recorded: June 2014, views: 98
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Ordinal embedding refers to the following problem: all we know about an unknown set of points x1,…,xn∈Rd are ordinal constraints of the form ∥xi−xj∥<∥xk−xl∥; the task is to construct a realization y1,…,yn∈Rd that preserves these ordinal constraints. It has been conjectured since the 1960ies that upon knowledge of all ordinal constraints a large but finite set of points can be approximately reconstructed up to a similarity transformation. The main result of our paper is a formal proof of this conjecture.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !