An extended set of FORTRAN basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Matrix computations (3rd ed.)
A semidiscrete matrix decomposition for latent semantic indexing information retrieval
ACM Transactions on Information Systems (TOIS)
The QLP Approximation to the Singular Value Decomposition
SIAM Journal on Scientific Computing
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
On FastMap and the Convex Hull of Multivariate Data: Toward Fast and Robust Dimension Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Given a set of pairwise object distances and a dimension $k$, FastMap and RobustMap algorithms compute a set of $k$-dimensional coordinates for the objects. These metric space embedding methods implicitly assume a higher-dimensional coordinate representation and are a sequence of translations and orthogonal projections based on a sequence of object pair selections (called pivot pairs). We develop a matrix computation viewpoint of these algorithms that operates on the coordinate representation explicitly using Householder reflections. The resulting coordinate mapping algorithm (CMA) is a fast approximate alternative to truncated principal component analysis (PCA), and it brings the FastMap and RobustMap algorithms into the mainstream of numerical computation where standard BLAS building blocks are used. Motivated by the geometric nature of the embedding methods, we further show that truncated PCA can be computed with CMA by specific pivot pair selections. Describing FastMap, RobustMap, and PCA as CMA computations with different pivot pair choices unifies the methods along a pivot pair selection spectrum. We also sketch connections to the semidiscrete decomposition and the QLP decomposition.