An ILP refinement operator for biological grammar learning
Fredouille, DC, Bryant, CH, Jayawickreme, CK, Jupe, S and Topp, S 2007, 'An ILP refinement operator for biological grammar learning' , in: Inductive logic programming , Lecture notes in artificial intelligence (subseries of Lecture notes in computer science) (4455) , Springer, Berlin / Heidelberg, Germany, pp. 214-228.
Download (296kB) | Preview
We are interested in using Inductive Logic Programming (ILP) to infer grammars representing sets of biological sequences. We call these biological grammars. ILP systems are well suited to this task in the sense that biological grammars have been represented as logic programs using the Definite Clause Grammar or the String Variable Grammar formalisms. However, the speed at which ILP systems can generate biological grammars has been shown to be a bottleneck. This paper presents a novel refinement operator implementation, specialised to infer biological grammars with ILP techniques. This implementation is shown to significantly speed-up inference times compared to the use of the classical refinement operator: time gains larger than 5-fold were observed in 4/5 of the experiments, and the maximum observed gain is over 300-fold.
Actions (login required)
|Edit record (repository staff only)|