3718 search results - page 457 / 744 » On learning with dissimilarity functions |
214
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
175
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
194
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
146
click to vote
AAAI
2008
15 years 9 months ago
2008
Machine learning approaches to indoor WiFi localization involve an offline phase and an online phase. In the offline phase, data are collected from an environment to build a local...
201
click to vote
NIPS
2001
15 years 8 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...