Skip to main content

Term comparisons in first-order similarity measures

  • Conference paper
  • First Online:
Inductive Logic Programming (ILP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1446))

Included in the following conference series:

Abstract

The similarity measures used in first-order IBL so far have been limited to the function-free case. In this paper we show that a lot of predictive power can be gained by allowing lists and other terms in the input representation and designing similarity measures that work directly on these structures. We present an improved similarity measure for the first-order instance based learner Ribl that employs the concept of edit distances to efficiently compute distances between lists and terms, discuss its computational and formal properties, and show that it is empirically superior by a wide margin on a problem from the domain of biochemistry.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho. Algorithms for Finding Patterns in Strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A. Algorithms and Complexity, pages 255–300. The MIT Press, 1990.

    Google Scholar 

  2. J. G. Belasco and G. Brawerman. Control of messengerRNA Stability. Academic Press, 1993.

    Google Scholar 

  3. G. Bisson. Conceptual Clustering in a First-Order Logic Representation. In B. Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 458–462. John Wiley, 1992.

    Google Scholar 

  4. U. Bohnebeck, W. Sälter, O. Herzog, M. Wischnewsky, and D. Blohm. An Approach to mRNA Signalstructure Detection through Knowledge Discovery. In Proceedings of GCB'97, pages 125–126, 1997.

    Google Scholar 

  5. S. Džeroski, S. Schulze-Kremer, K. Heidtke, K. Siems, and D. Wettschereck. Applying ILP to Diterpene Structure Elucidation from 13C NMR Spectra. In S. Muggleton, editor, Proceedings of the 6th International Workshop on Inductive Logic Programming, pages 14–27. Stockholm University, Royal Institute of Technology, 1996.

    Google Scholar 

  6. W. Emde and D. Wettschereck. Relational Instance-Based Learning. In L. Saitta, editor, Proceedings of the 13th International Conference on Machine Learning, pages 122–130. Morgan Kaufmann, 1996.

    Google Scholar 

  7. A. Hutchinson. Metrics on Terms and Clauses. In M. Someren and G. Widmer, editors, Proceedings of the 9th European Conference on Machine Learning, volume 1224 of LNAI, pages 138–145. Springer-Verlag, 1997.

    Google Scholar 

  8. R. D. Klausner, T. A. Rouault, and J. B. Harford. Regulating the Fate of mRNA: The Control of Cellular Iron Metabolism. Cell, 72:19–28, 1993.

    Google Scholar 

  9. S. L. Low and M. J. Berry. Knowing When Not to Stop: Selenocysteine Incorporation in Eukaryotes. Trends in Biochemistry Sciences, 21:203–208, 1996.

    Google Scholar 

  10. J. E. G. McCarthy and H. Kollmus. Cytoplasmic mRNA-Protein Interactions in Eukaryotic Gene Expression. Trends in Biochemistry Sciences, pages 191–197, 1995.

    Google Scholar 

  11. S.-H. Nienhuys-Cheng. Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept. In N. Lavrač and S. Džeroski, editors, Proceedings of the 7th International Workshop on Inductive Logic Programming, volume 1297 of LNAI, pages 213–226. Springer-Verlag, 1997.

    Google Scholar 

  12. M. Sebag. Distance Induction in First Order Logic. In N. Lavrač and S. Džeroski, editors, Proceedings of the 7th International Workshop on Inductive Logic Programming, volume 1297 of LNAI, pages 264–272. Springer-Verlag, 1997.

    Google Scholar 

  13. B. A. Shapiro and K. Zhang. Comparing Multiple RNA Secondary Structures Using Tree Comparisons. CABIOS, 6(4):309–318, 1990.

    Google Scholar 

  14. K. Tai. The Tree-to-Tree Correction Problem. Journal of the ACM, 26(3):422–433, 1979.

    Google Scholar 

  15. E. Ukkonen. Algorithms for Approximate String Matching. Inform. and Control, 64:100–118, 1985.

    Google Scholar 

  16. R. Wagner and M. Fischer, The String-to-String Correction Problem. Journal of the ACM, 21(1):168–173, 1974.

    Google Scholar 

  17. D. Wettschereck and D. Aha. Weighting Features. In M. Veloso and A. Aamodt, editors, Proceedings of the 1st International Conference on Case-Based Reasoning, volume 1010 of LNAI, pages 347–358. Springer-Verlag, 1995.

    Google Scholar 

  18. K. Zhang and D. Shasha. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. SIAM J. Computing, 18(6):1245–1262, 1989.

    Google Scholar 

  19. M. Zuker and P. Stiegler. Optimal Computer Folding of Large RNA Sequences Using Thermodynamics and Auxiliary Information. Nucleic Acids Research, 9(1),1245–1262 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

David Page

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bohnebeck, U., Horváth, T., Wrobel, S. (1998). Term comparisons in first-order similarity measures. In: Page, D. (eds) Inductive Logic Programming. ILP 1998. Lecture Notes in Computer Science, vol 1446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027311

Download citation

  • DOI: https://doi.org/10.1007/BFb0027311

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64738-6

  • Online ISBN: 978-3-540-69059-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics