1310 search results - page 44 / 262 » Learning the k in k-means |
150
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
151
click to vote
ECML
2006
Springer
15 years 9 months ago
2006
Springer
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
158
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
147
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We give a compression scheme for any maximum class of VC dimension d that compresses any sample consistent with a concept in the class to at most d unlabeled points from the domain...
