1283 search results - page 35 / 257 » Learning Voting Trees |
ALT
2010
Springer
13 years 9 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 8 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...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
MLCW
2005
Springer
14 years 1 months ago
2005
Springer
The Recognizing Textual Entailment System shown here is based on the use of a broad-coverage parser to extract dependency relationships; in addition, WordNet relations are used to ...
ML
2000
ACM
13 years 7 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...