3050 search results - page 198 / 610 » On-line Algorithms in Machine Learning |
114
click to vote
ICALT
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper introduces new metrics for course evaluation. It is also proposes a ranking algorithm that classifies courses based on the previous course evaluation metrics and sugg...
144
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
131
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...
125
Voted
ICML
2001
IEEE
16 years 5 months ago
2001
IEEE
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
138
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...