April – An Inductive Logic Programming System
Inductive Logic Programming (ILP) is a Machine Learning research field that has been quite successful in knowledge discovery in relational domains. ILP systems use a set of pre-classified examples (positive and negative) and prior knowledge to learn a theory in which positive examples succeed and the negative examples fail. In this paper we present a novel ILP system called April, capable of exploring several parallel strategies in distributed and shared memory machines.
KeywordsAssociation Rule Inductive Logic Inductive Logic Programming Average Execution Time Machine Learn Research
Unable to display preview. Download preview PDF.
- 3.Cussens, J.: Part-of-speech disambiguation using ilp. Technical Report PRG-TR-25-96, Oxford University Computing Laboratory (1996)Google Scholar
- 4.Camacho, R.: As lazy as it can be. In: The Eighth Scandinavian Conference on Artificial Intelligence (SCAI 2003), Bergen, Norway, pp. 47–58 (November 2003)Google Scholar
- 6.Fonseca, N.A., Silva, F., Santos Costa, V., Camacho, R.: A pipelined data-parallel algorithm for ILP. In: Proceedings of 2005 IEEE International Conference on Cluster Computing. IEEE, Los Alamitos (2005)Google Scholar
- 8.Muggleton, S.: Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)Google Scholar
- 9.Dehaspe, L., Toironen, H.: Relational Data Mining. In: Discovery of relational association rules, pp. 189–208. Springer, Heidelberg (2000)Google Scholar
- 11.Davies, T., Russell, S.: A logical approach to reasoning by analogy. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence, Los Altos, California, pp. 264–270 (1987)Google Scholar
- 12.Srinivasan, A.: The Aleph Manual (2003)Google Scholar