539 search results - page 100 / 108 » Learning Monotonic Linear Functions |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
NIPS
2001
13 years 9 months ago
2001
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...
NIPS
1998
13 years 9 months ago
1998
We present a method for learning complex appearance mappings, such as occur with images of articulated objects. Traditional interpolation networks fail on this case since appearan...
CDC
2008
IEEE
13 years 7 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
DATAMINE
2006
13 years 7 months ago
2006
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...