5771 search results - page 61 / 1155 » Learning similarity space |
95
Voted
IJON
2002
15 years 6 days 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 ...
84
Voted
CIKM
2009
Springer
15 years 7 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...
82
Voted
ALT
2008
Springer
15 years 9 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...
109
click to vote
SOCIALCOM
2010
14 years 10 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...
122
Voted
ECML
2006
Springer
15 years 4 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 ...