Sciweavers

68 search results - page 13 / 14
» Learning Latent Tree Graphical Models
Sort
View
ESANN
2006
14 years 8 days ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
JMLR
2010
141views more  JMLR 2010»
13 years 5 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
CVPR
2008
IEEE
15 years 27 days ago
Unsupervised discovery of visual object class hierarchies
Objects in the world can be arranged into a hierarchy based on their semantic meaning (e.g. organism ? animal ? feline ? cat). What about defining a hierarchy based on the visual ...
Josef Sivic, Bryan C. Russell, Andrew Zisserman, W...
CIA
2007
Springer
14 years 5 months ago
A Probabilistic Framework for Decentralized Management of Trust and Quality
In this paper, we propose a probabilistic framework targeting three important issues in the computation of quality and trust in decentralized systems. Specifically, our approach a...
Le-Hung Vu, Karl Aberer
JMLR
2010
179views more  JMLR 2010»
13 years 5 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby