Detecting low-rank clusters via random sampling

Research output: Contribution to journalArticle

Abstract

We present an algorithm for detecting a low-rank cluster of vectors from within a much larger group of vectors. This algorithm relies on a basic geometric property of high-dimensional space: Most of the volume of a typical eccentric ellipsoid is confined to relatively few orthants within the ambient space. This simple fact can be used to quickly detect a collection of vectors with low numerical rank from amongst a larger group of vectors with higher numerical rank.

Original languageEnglish (US)
Pages (from-to)215-222
Number of pages8
JournalJournal of Computational Physics
Volume231
Issue number1
DOIs
StatePublished - Jan 1 2012

Fingerprint

random sampling
Sampling
eccentrics
ellipsoids

Keywords

  • Random rotation projection

ASJC Scopus subject areas

  • Computer Science Applications
  • Physics and Astronomy (miscellaneous)

Cite this

Detecting low-rank clusters via random sampling. / Rangan, Aaditya.

In: Journal of Computational Physics, Vol. 231, No. 1, 01.01.2012, p. 215-222.

Research output: Contribution to journalArticle

@article{6217b369ba5a46979ffc16ebd7aecc9e,
title = "Detecting low-rank clusters via random sampling",
abstract = "We present an algorithm for detecting a low-rank cluster of vectors from within a much larger group of vectors. This algorithm relies on a basic geometric property of high-dimensional space: Most of the volume of a typical eccentric ellipsoid is confined to relatively few orthants within the ambient space. This simple fact can be used to quickly detect a collection of vectors with low numerical rank from amongst a larger group of vectors with higher numerical rank.",
keywords = "Random rotation projection",
author = "Aaditya Rangan",
year = "2012",
month = "1",
day = "1",
doi = "10.1016/j.jcp.2011.09.008",
language = "English (US)",
volume = "231",
pages = "215--222",
journal = "Journal of Computational Physics",
issn = "0021-9991",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Detecting low-rank clusters via random sampling

AU - Rangan, Aaditya

PY - 2012/1/1

Y1 - 2012/1/1

N2 - We present an algorithm for detecting a low-rank cluster of vectors from within a much larger group of vectors. This algorithm relies on a basic geometric property of high-dimensional space: Most of the volume of a typical eccentric ellipsoid is confined to relatively few orthants within the ambient space. This simple fact can be used to quickly detect a collection of vectors with low numerical rank from amongst a larger group of vectors with higher numerical rank.

AB - We present an algorithm for detecting a low-rank cluster of vectors from within a much larger group of vectors. This algorithm relies on a basic geometric property of high-dimensional space: Most of the volume of a typical eccentric ellipsoid is confined to relatively few orthants within the ambient space. This simple fact can be used to quickly detect a collection of vectors with low numerical rank from amongst a larger group of vectors with higher numerical rank.

KW - Random rotation projection

UR - http://www.scopus.com/inward/record.url?scp=80054861590&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054861590&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2011.09.008

DO - 10.1016/j.jcp.2011.09.008

M3 - Article

VL - 231

SP - 215

EP - 222

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

IS - 1

ER -