title: The kernel semi-least squares method for sparse distance approximation.
abstract: We extend the semi-least squares problem defined by Rao and Mitra ( 1971 ) to the kernel semi-least squares problem. We introduce subset projection, a technique that produces a solution to this problem. We show how the results of subset projection can be used to approximate a computationally expensive distance metric.
authors.affiliation: Department of Computer Science, Boston University, Boston, MA 02215, USA. samepst@cs.bu.edu
authors.forename: Samuel
authors.initials: S
authors.lastname: Epstein
authors.forename: Margrit
authors.initials: M
authors.lastname: Betke