Affiliations: [a] Methods of Artificial Intelligence, Sekr. Fr 5–8, Faculty IV, TU Berlin, Franklinstr. 28/29, D-10587 Berlin, Germany. Tel.: +49 30 314 25491; Fax: +49 30 314 24913; E-mail: [email protected], [email protected] | [b] Pace Aerospace Engineering and Information Technology GmbH, Rotherstr. 20, D-10245 Berlin, Germany. E-mail: [email protected]
Correspondence:
[*]
Corresponding author
Abstract: The paper addresses the question how learning class discriminations and learning characteristic class descriptions can be related in relational learning. We present the approach TRITOP/MATCHBOX combining the relational decision tree algorithm TRITOP with the connectionist approach MATCHBOX. TRITOP constructs efficiently a relational decision tree for the fast discrimination of classes of relational descriptions, while MatchBox is used for constructing class prototypes. Although TRITOP's decision trees perform very well in the classification task, they are difficult to understand and to explain. In order to overcome this disadvantage of decision trees in general, in a second step the decision tree is supplemented by prototypes. Prototypes are generalized graph theoretic descriptions of common substructures of those subclasses of the training set that are defined by the leaves of the decision tree. Such prototypes give a comprehensive and understandable description of the subclasses. In the prototype construction, the connectionist approach MATCHBOX is used to perform fast graph matching and graph generalisation, which are originally NP-complete tasks. The constructed prototypes can be used for classification in a decision list framework, where the decision list is constructed from the decision tree.
