Sciweavers

481 search results - page 48 / 97
» Learning relational probability trees
Sort
View
DIS
2009
Springer
14 years 2 months ago
An Iterative Learning Algorithm for Within-Network Regression in the Transductive Setting
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
AAAI
2006
13 years 9 months ago
Value-Function-Based Transfer for Reinforcement Learning Using Structure Mapping
Transfer learning concerns applying knowledge learned in one task (the source) to improve learning another related task (the target). In this paper, we use structure mapping, a ps...
Yaxin Liu, Peter Stone
COLT
2000
Springer
13 years 12 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
IJAR
2006
89views more  IJAR 2006»
13 years 7 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
UAI
2003
13 years 9 months ago
Learning Riemannian Metrics
We consider the problem of learning a Riemannian metric associated with a given differentiable manifold and a set of points. Our approach to the problem involves choosing a metric...
Guy Lebanon