Sciweavers

702 search results - page 55 / 141
» Learning Probabilistic Models of Relational Structure
Sort
View
ECAI
2000
Springer
15 years 4 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
CORR
2012
Springer
220views Education» more  CORR 2012»
13 years 8 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
113
Voted
ISBI
2008
IEEE
16 years 1 months ago
A learning based hierarchical model for vessel segmentation
In this paper we present a learning based method for vessel segmentation in angiographic videos. Vessel Segmentation is an important task in medical imaging and has been investiga...
Richard Socher, Adrian Barbu, Dorin Comaniciu
101
Voted
ICDM
2007
IEEE
289views Data Mining» more  ICDM 2007»
15 years 6 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
108
Voted
AIPS
2007
15 years 2 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier