6715 search results - page 634 / 1343 » Learning from a Test Set |
209
click to vote
JAMDS
2002
15 years 7 months ago
2002
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
188
Voted
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
202
Voted
JORS
2010
15 years 2 months ago
2010
In order to manage model risk, financial institutions need to set up validation processes so as to monitor the quality of the models on an ongoing basis. Validation can be conside...
248
Voted
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
210
Voted
GECCO
2005
Springer
16 years 24 days ago
2005
Springer
Self-organization of brain areas in animals begins prenatally, evidently driven by spontaneously generated internal patterns. The neural structures continue to develop postnatally...