Sciweavers

481 search results - page 1 / 97
» Learning relational probability trees
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 9 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
ECML
2005
Springer
14 years 29 days ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...
ML
2012
ACM
413views Machine Learning» more  ML 2012»
12 years 3 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
ICMLA
2007
13 years 9 months ago
Estimating class probabilities in random forests
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
Henrik Boström