588 search results - page 20 / 118 » Computing the Dimension of Linear Subspaces |
134
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
125
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
179
Voted
TSMC
2010
14 years 10 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
135
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
140
Voted
SDM
2009
SIAM
16 years 29 days ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...