Sciweavers

46 search results - page 4 / 10
» A game-theoretic procedure for learning hierarchically struc...
Sort
View
IJCAI
2007
15 years 1 months ago
Incremental Construction of Structured Hidden Markov Models
This paper presents an algorithm for inferring a Structured Hidden Markov Model (S-HMM) from a set of sequences. The S-HMMs are a sub-class of the Hierarchical Hidden Markov Model...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
CVPR
2008
IEEE
16 years 1 months ago
Learning stick-figure models using nonparametric Bayesian priors over trees
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
Edward Meeds, David A. Ross, Richard S. Zemel, Sam...
CORR
2010
Springer
167views Education» more  CORR 2010»
14 years 12 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CVPR
2007
IEEE
16 years 1 months ago
The Hierarchical Isometric Self-Organizing Map for Manifold Representation
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
Haiying Guan, Matthew Turk
PAMI
2011
14 years 6 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams