1683 search results - page 70 / 337 » Learning with Mixtures of Trees |
IDA
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. We propose a new algorithm for learning isotonic classification trees. It relabels non-monotone leaf nodes by performing the isotonic regression on the collection of leaf...
VLDB
2006
ACM
14 years 9 months ago
2006
ACM
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...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
ICML
1996
IEEE
14 years 10 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...