Travelled to:3 × USA
Collaborated with:M.J.Pazzani ∅ A.L.Strehl M.L.Littman H.Hirsh
Talks about:algorithm (2) learn (2) use (2) threshold (1) problem (1) linear (1) expert (1) experi (1) effici (1) combin (1)
Person: Chris Mesterharm
DBLP: Mesterharm:Chris
Contributed to:
2011
20062003Wrote 3 papers:
- KDD-2011-MesterharmP #algorithm #learning #online #using
- Active learning using on-line algorithms (CM, MJP), pp. 850–858.
- ICML-2006-StrehlMLH #learning #problem
- Experience-efficient learning in associative bandit problems (ALS, CM, MLL, HH), pp. 889–896.
- ICML-2003-Mesterharm #algorithm #multi #using
- Using Linear-threshold Algorithms to Combine Multi-class Sub-experts (CM), pp. 544–551.