879 search results - page 2 / 176 » Kolmogorov Complexity and Model Selection |
MCU
2007
13 years 8 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
ICANN
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
STACS
2005
Springer
14 years 9 days ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
NIPS
2003
13 years 8 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
DCC
2006
IEEE
14 years 6 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...