Journal of Intelligent Information Systems

, Volume 42, Issue 2, pp 255–281

A method for reduction of examples in relational learning

  • Ondřej Kuželka
  • Andrea Szabóová
  • Filip Železný
Article

DOI: 10.1007/s10844-013-0294-z

Cite this article as:
Kuželka, O., Szabóová, A. & Železný, F. J Intell Inf Syst (2014) 42: 255. doi:10.1007/s10844-013-0294-z

Abstract

Feature selection methods often improve the performance of attribute-value learning. We explore whether also in relational learning, examples in the form of clauses can be reduced in size to speed up learning without affecting the learned hypothesis. To this end, we introduce the notion of safe reduction: a safely reduced example cannot be distinguished from the original example under the given hypothesis language bias. Next, we consider the particular, rather permissive bias of bounded treewidth clauses. We show that under this hypothesis bias, examples of arbitrary treewidth can be reduced efficiently. We evaluate our approach on four data sets with the popular system Aleph and the state-of-the-art relational learner nFOIL. On all four data sets we make learning faster in the case of nFOIL, achieving an order-of-magnitude speed up on one of the data sets, and more accurate in the case of Aleph.

Keywords

Relational learning Feature selection Bounded treewidth 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Ondřej Kuželka
    • 1
  • Andrea Szabóová
    • 1
  • Filip Železný
    • 1
  1. 1.Faculty of Electrical EngineeringCzech Technical University in PraguePragueCzech Republic