Sciweavers

68 search results - page 10 / 14
» Learning Latent Tree Graphical Models
Sort
View
ECML
2006
Springer
15 years 1 months ago
Combinatorial Markov Random Fields
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
Ron Bekkerman, Mehran Sahami, Erik G. Learned-Mill...
ML
2012
ACM
413views Machine Learning» more  ML 2012»
13 years 5 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
NIPS
2008
14 years 11 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
AAAI
2007
15 years 5 days ago
On the Prospects for Building a Working Model of the Visual Cortex
Human visual capability has remained largely beyond the reach of engineered systems despite intensive study and considerable progress in problem understanding, algorithms and comp...
Thomas Dean, Glenn Carroll, Richard Washington