140 search results - page 1 / 28 » Learning Relational Concepts with Decision Trees |
ICML
1996
IEEE
14 years 6 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...
SEMWEB
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we propose the "Classification-Based Learning of Subsumption Relations for the Alignment of Ontologies" (CSR) method. Given a pair of concepts from two onto...
ICDM
2009
IEEE
13 years 12 months ago
2009
IEEE
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...