1376 search results - page 123 / 276 » The Localization Hypothesis and Machines |
100
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
90
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
146
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...