187 search results - page 19 / 38 » Bounding the cost of learned rules |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
ESANN
2006
14 years 11 months ago
2006
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
BDA
2003
14 years 11 months ago
2003
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...