11 search results - page 2 / 3 » Maximum Likelihood in Cost-Sensitive Learning: Model Specifi... |
NN
2002
Springer
13 years 4 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
ICRA
2003
IEEE
13 years 10 months ago
2003
IEEE
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...