417 search results - page 14 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
83
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
146
click to vote
CP
2011
Springer
13 years 9 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...