588 search results - page 2 / 118 » Computing the Dimension of Linear Subspaces |
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
NIPS
2008
13 years 6 months ago
2008
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...