Random projection is a simple geometric technique for reducing the dimensionality of a set of points in Euclidean space while preserving pairwise distances approximately. The technique plays a key role in several breakthrough developments in the field of algorithms. In other cases, it provides elegant alternative proofs. The book begins with an elementary description of the technique and its basic properties. Then it develops the method in the context of applications, which are divided into three groups.
"synopsis" may belong to another edition of this title.
The book offers a broad view of its subject, with a good selection of examples and a vast set of bibliographic references. It could be used well as a starting point for research in this area. The presence of a number of exercises [also] makes it a possible choice for [a] textbook on this method. --Mathematical Reviews
A very nice piece of work -- the author succeeds in tying together a lot of recent developments in algorithms under an appealing theme. --Professor Jon Kleinberg, Cornell University
This is an elegant monograph, dense in ideas and techniques, diverse in its applications, and above all, vibrant with the author's enthusiasm for the area. --from the Foreword by Christos H. Papadimitriou, University of California, Berkeley
"About this title" may belong to another edition of this title.
Book Description American Mathematical Society, 2004. Book Condition: Good. Volume 65. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. , 500grams, ISBN:9780821820186. Bookseller Inventory # 7109288
Book Description Amer Mathematical Society, 2004. Hard Cover. Book Condition: As New. No Jacket. BRAND NEW IN SHRINK WRAP. (S15). Bookseller Inventory # 100702214