158 search results - page 16 / 32 » A Dynamic Adaptation of AD-trees for Efficient Machine Learn... |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper gives an efficient Bayesian method for inferring the parameters of a PlackettLuce ranking model. Such models are parameterised distributions over rankings of a finite s...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Speech recognition is usually based on Hidden Markov Models (HMMs), which represent the temporal dynamics of speech very efficiently, and Gaussian mixture models, which do non-opt...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
CIARP
2008
Springer
13 years 9 months ago
2008
Springer
The performance of supervised learners depends on the presence of a relatively large labeled sample. This paper proposes an automatic ongoing learning system, which is able to inco...
WSDM
2012
ACM
12 years 3 months ago
2012
ACM
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...