Sciweavers

481 search results - page 12 / 97
» Learning relational probability trees
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 2 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
NIPS
2001
13 years 9 months ago
The g Factor: Relating Distributions on Features to Distributions on Images
We describe the g-factor which relates probability distributions on image features to distributions on the images themselves. The g-factor depends only on our choice of features a...
James M. Coughlan, Alan L. Yuille
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 8 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
ICML
2005
IEEE
14 years 8 months ago
Dirichlet enhanced relational learning
We apply nonparametric hierarchical Bayesian modelling to relational learning. In a hierarchical Bayesian approach, model parameters can be "personalized", i.e., owned b...
Zhao Xu, Volker Tresp, Kai Yu, Shipeng Yu, Hans-Pe...