Sciweavers

169 search results - page 7 / 34
» Reductions among high dimensional proximity problems
Sort
View
PR
2008
129views more  PR 2008»
13 years 7 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
JMLR
2010
119views more  JMLR 2010»
13 years 2 months ago
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data
Different aspects of the curse of dimensionality are known to present serious challenges to various machine-learning methods and tasks. This paper explores a new aspect of the dim...
Milos Radovanovic, Alexandros Nanopoulos, Mirjana ...
ICPR
2010
IEEE
14 years 2 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
ICML
2006
IEEE
14 years 8 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
CVPR
2006
IEEE
14 years 9 months ago
Dimensionality Reduction by Learning an Invariant Mapping
Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that "similar" points in input space are mapped to ne...
Raia Hadsell, Sumit Chopra, Yann LeCun