481 search results - page 30 / 97 » Learning relational probability trees |
STOC
1994
ACM
15 years 4 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
PKDD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
KDD
1999
ACM
15 years 4 months ago
1999
ACM
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
111
click to vote
AAAI
2010
15 years 1 months ago
2010
Many machine learning applications that involve relational databases incorporate first-order logic and probability. Markov Logic Networks (MLNs) are a prominent statistical relati...
116
click to vote
ICMLA
2010
14 years 9 months ago
2010
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...