3378 search results - page 254 / 676 » Learning in Friedberg Numberings |
175
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
157
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
155
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
149
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
192
click to vote
ACML
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Topic models are a discrete analogue to principle component analysis and independent component analysis that model topic at the word level within a document. They have ma...