3006 search results - page 24 / 602 » Dimensionality reduction and generalization |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Non-linear dimensionality reductionmethods are powerful techniques to deal with
high-dimensional datasets. However, they often are susceptible to local minima
and perform poorly ...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
BMCBI
2010
13 years 8 months ago
2010
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...