Efficient methods for grouping vectors into low-rank clusters

Research output: Contribution to journalArticle

Abstract

We present a few practical algorithms for sorting vectors into low-rank clusters. These algorithms rely on a subdivision scheme applied to the space of projections from d-dimensions to 1-dimension. This subdivision scheme can be thought of as a higher-dimensional generalization of quicksort. Given the ability to quickly sort vectors into low-rank clusters, one can efficiently search a matrix for low-rank sub-blocks of large diameter. The ability to detect large-diameter low-rank sub-blocks has many applications, ranging from data-analysis to matrix-compression.

Original languageEnglish (US)
Pages (from-to)5684-5703
Number of pages20
JournalJournal of Computational Physics
Volume230
Issue number14
DOIs
StatePublished - Jun 20 2011

Fingerprint

subdivisions
matrices
classifying
Sorting
projection

Keywords

  • Hierarchical factorization
  • Principal-component-analysis

ASJC Scopus subject areas

  • Computer Science Applications
  • Physics and Astronomy (miscellaneous)

Cite this

Efficient methods for grouping vectors into low-rank clusters. / Rangan, Aaditya.

In: Journal of Computational Physics, Vol. 230, No. 14, 20.06.2011, p. 5684-5703.

Research output: Contribution to journalArticle

@article{a1b752a562d94b1fb4a2047f84c7d0f2,
title = "Efficient methods for grouping vectors into low-rank clusters",
abstract = "We present a few practical algorithms for sorting vectors into low-rank clusters. These algorithms rely on a subdivision scheme applied to the space of projections from d-dimensions to 1-dimension. This subdivision scheme can be thought of as a higher-dimensional generalization of quicksort. Given the ability to quickly sort vectors into low-rank clusters, one can efficiently search a matrix for low-rank sub-blocks of large diameter. The ability to detect large-diameter low-rank sub-blocks has many applications, ranging from data-analysis to matrix-compression.",
keywords = "Hierarchical factorization, Principal-component-analysis",
author = "Aaditya Rangan",
year = "2011",
month = "6",
day = "20",
doi = "10.1016/j.jcp.2011.03.048",
language = "English (US)",
volume = "230",
pages = "5684--5703",
journal = "Journal of Computational Physics",
issn = "0021-9991",
publisher = "Academic Press Inc.",
number = "14",

}

TY - JOUR

T1 - Efficient methods for grouping vectors into low-rank clusters

AU - Rangan, Aaditya

PY - 2011/6/20

Y1 - 2011/6/20

N2 - We present a few practical algorithms for sorting vectors into low-rank clusters. These algorithms rely on a subdivision scheme applied to the space of projections from d-dimensions to 1-dimension. This subdivision scheme can be thought of as a higher-dimensional generalization of quicksort. Given the ability to quickly sort vectors into low-rank clusters, one can efficiently search a matrix for low-rank sub-blocks of large diameter. The ability to detect large-diameter low-rank sub-blocks has many applications, ranging from data-analysis to matrix-compression.

AB - We present a few practical algorithms for sorting vectors into low-rank clusters. These algorithms rely on a subdivision scheme applied to the space of projections from d-dimensions to 1-dimension. This subdivision scheme can be thought of as a higher-dimensional generalization of quicksort. Given the ability to quickly sort vectors into low-rank clusters, one can efficiently search a matrix for low-rank sub-blocks of large diameter. The ability to detect large-diameter low-rank sub-blocks has many applications, ranging from data-analysis to matrix-compression.

KW - Hierarchical factorization

KW - Principal-component-analysis

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

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

U2 - 10.1016/j.jcp.2011.03.048

DO - 10.1016/j.jcp.2011.03.048

M3 - Article

AN - SCOPUS:79955730233

VL - 230

SP - 5684

EP - 5703

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

IS - 14

ER -