Sciweavers

440 search results - page 11 / 88
» Learning the structure of manifolds using random projections
Sort
View
ICPR
2010
IEEE
15 years 4 months ago
A Bound on the Performance of LDA in Randomly Projected Data Spaces
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
Robert John Durrant, Ata Kaban
85
Voted
COMPGEOM
2010
ACM
15 years 1 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
93
Voted
ICPR
2008
IEEE
15 years 4 months ago
Semi-supervised discriminant analysis based on UDP regularization
We propose a semi-supervised learning algorithm for discriminant analysis, which uses the geometric structure of both labeled and unlabeled samples and perform a manifold regulari...
Huining Qiu, Jian-Huang Lai, Jian Huang, Yu Chen
ISBI
2008
IEEE
15 years 3 months ago
On the non-uniform complexity of brain connectivity
A stratification and manifold learning approach for analyzing High Angular Resolution Diffusion Imaging (HARDI) data is introduced in this paper. HARDI data provides highdimensio...
Gloria Haro, Christophe Lenglet, Guillermo Sapiro,...
91
Voted
CVPR
2004
IEEE
15 years 11 months ago
Unsupervised Learning of Image Manifolds by Semidefinite Programming
Can we detect low dimensional structure in high dimensional data sets of images? In this paper, we propose an algorithm for unsupervised learning of image manifolds by semidefinit...
Kilian Q. Weinberger, Lawrence K. Saul