An ILP refinement operator for biological grammar learning

Part of book or chapter of book English OPEN
Fredouille, DC ; Bryant, CH ; Jayawickreme, CK ; Jupe, S ; Topp, S
  • Publisher: Springer
  • Related identifiers: doi: 10.1007/978-3-540-73847-3_24
  • Subject: other | QH301 | QA75

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.
  • References (8)

    Y. Sakakibara, M. Brown, R. Hughey, I. Saira Mian, K. Sjolander, R. C. [SBH+94] analysis { a survey of the formalism and a comparison with augmented

    biological language of DNA. Journal of logic Programming, 12, 1993.

    ceptors. Nat Rev Mol Cell Biol, 3(9)(6):39{50, 2002.

    F. Bergadano and L. De Raedt, editors, ECML-94, European Conference

    transition networks. Articial Intelligenc e, 13(3):231{278, May 1980.

    modeling. Nucleic Acids Research, 22:5112{5120, 1994.

    on Machine Learning, volume 784 of LNCS, pages 427{430. Springer, 1994.

    //, 1993.

  • Metrics
    views in OpenAIRE
    views in local repository
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    University of Salford Institutional Repository - IRUS-UK 0 68
Share - Bookmark