Sciweavers

273 search results - page 36 / 55
» Learning the Structure of Deep Sparse Graphical Models
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Representation and Matching of Articulated Shapes
We consider the problem of localizing the articulated and deformable shape of a walking person in a single view. We represent the non-rigid 2D body contour by a Bayesian graphical...
Jiayong Zhang, Robert T. Collins, Yanxi Liu
ACL
2007
13 years 9 months ago
A fully Bayesian approach to unsupervised part-of-speech tagging
Unsupervised learning of linguistic structure is a difficult problem. A common approach is to define a generative model and maximize the probability of the hidden structure give...
Sharon Goldwater, Tom Griffiths
IWINAC
2007
Springer
14 years 1 months ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
ICIP
2006
IEEE
14 years 9 months ago
A Profile Hidden Markov Model Framework for Modeling and Analysis of Shape
In this paper we propose a new framework for modeling 2D shapes. A shape is first described by a sequence of local features (e.g., curvature) of the shape boundary. The resulting ...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas
ICDM
2007
IEEE
289views Data Mining» more  ICDM 2007»
14 years 1 months ago
Latent Dirichlet Conditional Naive-Bayes Models
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
Arindam Banerjee, Hanhuai Shan