1107 search results - page 26 / 222 » Multi-instance tree learning |
171
click to vote
VLDB
2006
ACM
15 years 11 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
15 years 22 days 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
16 years 2 hour 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...
89
Voted
ICML
2002
IEEE
16 years 2 hour 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...
108
Voted
MLCW
2005
Springer
15 years 4 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 ...