5771 search results - page 61 / 1155 » Learning similarity space |
IJON
2002
13 years 9 months ago
2002
We study the relation between maps of a high-dimensional stimulus manifold onto an essentially two-dimensional cortical area and low-dimensional maps of stimulus features such as ...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Adapting to rank address the the problem of insufficient domainspecific labeled training data in learning to rank. However, the initial study shows that adaptation is not always...
ALT
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
SOCIALCOM
2010
13 years 8 months ago
2010
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
ECML
2006
Springer
14 years 1 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...