2520 search results - page 384 / 504 » The complexity of approximating entropy |
118
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
139
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
128
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...
106
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
151
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...