Sciweavers

273 search results - page 27 / 55
» Learning the Structure of Deep Sparse Graphical Models
Sort
View
UAI
1996
13 years 10 months ago
Learning Equivalence Classes of Bayesian Network Structures
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
David Maxwell Chickering
JMLR
2012
11 years 11 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
ICDAR
2009
IEEE
14 years 3 months ago
Learning Rich Hidden Markov Models in Document Analysis: Table Location
Hidden Markov Models (HMM) are probabilistic graphical models for interdependent classification. In this paper we experiment with different ways of combining the components of an ...
Ana Costa e Silva
ICPR
2008
IEEE
14 years 9 months ago
Fast protein homology and fold detection with sparse spatial sample kernels
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the or...
Pai-Hsi Huang, Pavel P. Kuksa, Vladimir Pavlovic
ICCV
1995
IEEE
14 years 6 days ago
Object Indexing Using an Iconic Sparse Distributed Memory
A general-purpose object indexingtechnique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces...
Rajesh P. N. Rao, Dana H. Ballard