Anderson, G. & Pfahringer, B. (2006). Random Relational Rules. In Proceedings of the 16th International Conference on Inductive Logic Programming, Santiago de Compostela, Spain, August 24-27. Santiago de Compostela, Spain: University of Coruna.
Permanent Research Commons link: http://hdl.handle.net/10289/1458
Exhaustive search in relational learning is generally infeasible, therefore some form of heuristic search is usually employed, such as in FOIL. On the other hand, so-called stochastic discrimination provides a framework for combining arbitrary numbers of weak classifiers (in this case randomly generated relational rules) in a way where accuracy improves with additional rules, even after maximal accuracy on the training data has been reached.  The weak classifiers must have a slightly higher probability of covering instances of their target class than of other classes. As the rules are also independent and identically distributed, the Central Limit theorem applies and as the number of weak classifiers/rules grows, coverages for different classes resemble well-separated normal distributions. Stochastic discrimination is closely related to other ensemble methods like Bagging, Boosting, or Random forests, all of which have been tried in relational learning [3, 4, 5].