Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Geibel, Petera; * | Schädler, Kristinab | Wysotzki, Fritza
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.
Keywords: machine learning, inductive logic programming, hopfield nets, decision trees, graphs
DOI: 10.3233/IDA-2003-7204
Journal: Intelligent Data Analysis, vol. 7, no. 2, pp. 125-140, 2003
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]