Sciweavers

1292 search results - page 176 / 259
» Bayesian learning in negotiation
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
Visual Learning Given Sparse Data of Unknown Complexity
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
Tao Xiang, Shaogang Gong
MM
2005
ACM
134views Multimedia» more  MM 2005»
14 years 1 months ago
Graph based multi-modality learning
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...
Hanghang Tong, Jingrui He, Mingjing Li, Changshui ...
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
NIPS
2007
13 years 9 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
CVPR
2000
IEEE
14 years 10 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu