1393 search results - page 118 / 279 » Machine Learning by Function Decomposition |
127
click to vote
ECML
2006
Springer
15 years 5 months ago
2006
Springer
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
100
click to vote
ICONIP
2007
15 years 3 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
153
Voted
COLT
2010
Springer
14 years 11 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
109
click to vote
ESANN
2003
15 years 3 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
142
click to vote
SSDBM
2010
IEEE
15 years 6 months ago
2010
IEEE
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...