Sciweavers

702 search results - page 59 / 141
» Learning Probabilistic Models of Relational Structure
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 8 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ICML
2000
IEEE
15 years 4 months ago
Discriminative Reranking for Natural Language Parsing
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
Michael Collins
AAAI
1994
15 years 1 months ago
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
Michael Lindenbaum, Shai Ben-David
97
Voted
ICANN
2010
Springer
15 years 1 months ago
A Bilinear Model for Consistent Topographic Representations
Visual recognition faces the difficult problem of recognizing objects despite the multitude of their appearances. Ample neuroscientific evidence shows that the cortex uses a topogr...
Urs Bergmann, Christoph von der Malsburg
105
Voted
SAC
2009
ACM
15 years 7 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad