Sciweavers

481 search results - page 44 / 97
» Learning relational probability trees
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
CVPR
2000
IEEE
14 years 9 months ago
Towards Automatic Discovery of Object Categories
We propose a method to learn heterogeneous models of object classes for visual recognition. The training images contain a preponderance of clutter and learning is unsupervised. Ou...
Markus Weber, Max Welling, Pietro Perona
IDA
2008
Springer
13 years 7 months ago
Symbolic methodology for numeric data mining
Currently statistical and artificial neural network methods dominate in data mining applications. Alternative relational (symbolic) data mining methods have shown their effectivene...
Boris Kovalerchuk, Evgenii Vityaev
COLT
2010
Springer
13 years 5 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
ICML
2009
IEEE
14 years 8 months ago
Learning Markov logic network structure via hypergraph lifting
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
Stanley Kok, Pedro Domingos