481 search results - page 65 / 97 » Learning relational probability trees |
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
ALT
2007
Springer
14 years 1 months ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
CL
2000
Springer
13 years 12 months ago
2000
Springer
In this paper I give a brief overview of recent work on uncertainty inAI, and relate it to logical representations. Bayesian decision theory and logic are both normative frameworks...
NIPS
2000
13 years 9 months ago
2000
We describe a neurally-inspired, unsupervised learning algorithm that builds a non-linear generative model for pairs of face images from the same individual. Individuals are then ...