Research Catalog

The random projection method

Title
The random projection method / Santosh S. Vempala.
Author
Vempala, Santosh S. (Santosh Srinivas), 1971-
Publication
Providence, R.I. : American Mathematical Society, [2004], ©2004.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextRequest in advance QA501 .V45 2004Off-site

Holdings

Details

Additional Authors
DIMACS (Group)
Description
ix, 105 pages; 26 cm.
Summary
"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."--BOOK JACKET.
Series Statement
DIMACS series in discrete mathematics and theoretical computer science, 1052-1798 ; v. 65
Uniform Title
DIMACS series in discrete mathematics and theoretical computer science ; v. 65.
Subjects
Note
  • "Center for Discrete Mathematics and Theoretical Computer Science [and others]."
Bibliography (note)
  • Includes bibliographical references (p. 97-100).
Contents
Foreword / Christos H. Papadimitriou -- Ch. 1. Random projection -- Pt. 1. Combinatorial optimization -- Ch. 2. Rounding via random projection -- Ch. 3. Embedding metrics in Euclidean space -- Ch. 4. Euclidean embeddings : beyond distance preservation -- Pt. 2. Learning theory -- Ch. 5. Robust concepts -- Ch. 6. Intersections of half-spaces -- Pt. 3. Information retrieval -- Ch. 7. Nearest neighbors -- Ch. 8. Indexing and clustering.
ISBN
0821820184 (alk. paper)
LCCN
2004046181
OCLC
  • ocm54803704
  • SCSB-5072272
Owning Institutions
Columbia University Libraries