777 search results - page 58 / 156 » Learning dynamic algorithm portfolios |
108
Voted
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
124
Voted
MANSCI
2006
15 years 2 months ago
2006
The problem of group ranking, a.k.a. rank aggregation, has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to ranking web pag...
114
Voted
WWW
2009
ACM
16 years 3 months ago
2009
ACM
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
133
Voted
NIPS
1993
15 years 3 months ago
1993
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
138
click to vote
PAMI
2008
15 years 2 months ago
2008
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...