Sciweavers

889 search results - page 32 / 178
» Observational Learning in Random Networks
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
ICANN
2010
Springer
13 years 10 months ago
Unsupervised Learning of Relations
Learning processes allow the central nervous system to learn relationships between stimuli. Even stimuli from different modalities can easily be associated, and these associations ...
Matthew Cook, Florian Jug, Christoph Krautz, Angel...
AAAI
2004
13 years 11 months ago
An Instance-Based State Representation for Network Repair
We describe a formal framework for diagnosis and repair problems that shares elements of the well known partially observable MDP and cost-sensitive classification models. Our cost...
Michael L. Littman, Nishkam Ravi, Eitan Fenson, Ri...
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 3 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
NIPS
2004
13 years 11 months ago
Exponential Family Harmoniums with an Application to Information Retrieval
Directed graphical models with one layer of observed random variables and one or more layers of hidden random variables have been the dominant modelling paradigm in many research ...
Max Welling, Michal Rosen-Zvi, Geoffrey E. Hinton