Sciweavers

204 search results - page 34 / 41
» Proposition-valued random variables as information
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
UAI
2004
13 years 8 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
UAI
2004
13 years 8 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
FSKD
2008
Springer
174views Fuzzy Logic» more  FSKD 2008»
13 years 8 months ago
A Hybrid Re-sampling Method for SVM Learning from Imbalanced Data Sets
Support Vector Machine (SVM) has been widely studied and shown success in many application fields. However, the performance of SVM drops significantly when it is applied to the pr...
Peng Li, Pei-Li Qiao, Yuan-Chao Liu
FTML
2008
185views more  FTML 2008»
13 years 7 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan