Prototypes Based Relational Learning

Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for classification. Nearest prototype approaches can alleviate this problem, by summarizing the data set in a reduced set of prototypes. In this paper we present an algorithm to build Relational Nearest Prototype Classifiers (rnpc). When compared with RIBL approaches, the algorithm is able to dramatically reduce the number of instances by selecting the most relevant prototypes, maintaining similar accuracy. The number of prototypes is obtained automatically by the algorithm, although it can be also bounded by the user. Empirical results on benchmark data sets demonstrate the utility of this approach compared to other instance based approaches. Key words: Inductive Logic Programming, Instance Based learning, Nearest Prototype.

• Type: Conference
• Year: 2008
• Where: AIMSA
• Authors: Rocío García-Durán, Fernando Fernández, Daniel Borrajo
• Keywords: AIMSA 2008, Artificial Intelligence, Data Sets, Nearest Prototype, Relational Nearest Prototype