275 search results - page 3 / 55 » A Comparison of Pruning Methods for Relational Concept Learn... |
IJCAI
1993
13 years 8 months ago
1993
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...
SEMWEB
2007
Springer
14 years 1 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...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
FLAIRS
2001
13 years 8 months ago
2001
We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, a...