Sciweavers

481 search results - page 3 / 97
» Learning relational probability trees
Sort
View
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
14 years 1 months ago
Learning through Changes: An Empirical Study of Dynamic Behaviors of Probability Estimation Trees
In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probabil...
Kun Zhang, Zujia Xu, Jing Peng, Bill P. Buckles
ESWS
2008
Springer
13 years 9 months ago
Adding Data Mining Support to SPARQL Via Statistical Relational Learning Methods
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
Christoph Kiefer, Abraham Bernstein, André ...
ICML
2001
IEEE
14 years 8 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan
ML
2008
ACM
100views Machine Learning» more  ML 2008»
13 years 7 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
ECSQARU
2009
Springer
14 years 2 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...