Skip to main content

Transformation-Based Learning Using Multirelational Aggregation

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

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

Included in the following conference series:

Abstract

Given the very widespread use of multirelational databases, ILP systems are increasingly being used on data originating from such warehouses. Unfortunately, even though not complex in structure, such business data often contain highly non-determinate components, making them difficult for ILP learners geared towards structurally complex tasks. In this paper, we build on popular transformation-based approaches to ILP and describe how they can naturally be extended with relational aggregation. We experimentall y show that this results in a multirelational learner that outperforms a structurally-oriented ILP system both in speed and accuracy on this class of problems.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Petr Berka. Guide to the Financial Data Set. In A. Siebes and P. Berka, editors, PKDD2000 Discovery Challenge, 2000.

    Google Scholar 

  2. Luce Cabibbo and Riccardo Torlone. A Framework for the Investigation of Aggregate Functions in Database Queries. In C. Beeri and P. Bruneman, editors, Proceedings of the Seventh International Conference on Database Theory (ICDT). Springer-Verlag, 1999.

    Google Scholar 

  3. Thorsten Joachims. Making Large-Scale SVM Learning Practical. In B. Schölkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods-Support Vector Learning. MIT Press, 1999.

    Google Scholar 

  4. Thorsten Joachims. Estimating the Generalization Performance of an SVM Efficiently. In P. Langley, editor, Proceedings of the Seventeenth International Conference on Machine Learning (ICML). Morgan Kaufmann, 2000.

    Google Scholar 

  5. Jörg-Uwe Kietz, Regina Zücker, and Anca Vaduva. Mining Mart: Combining Case-Based Reasoning and Multistrategy Learning into a Framework for Reusing KDD-Applications. In R. S. Michalski and P. Brazdil, editors, Proceedings of the Fifth International Workshop on Multistrategy Learning (MSL), 2000.

    Google Scholar 

  6. Stefan Kramer, Bernhard Pfahringer, and Christoph Helma. Stochastic Propositionalization of Non-Determinate Background Knowledge. In D. Page, editor, Proceedings of the Eighth International Conference on Inductive Logic Programming (ILP). Springer-Verlag, 1998.

    Google Scholar 

  7. Nada Lavrač. Principles of knowledge acquisition in expert systems. PhD thesis, University of Maribor, Ljubljana, Slovenia, 1990.

    Google Scholar 

  8. Nada Lavrač and Sašo Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1993.

    Google Scholar 

  9. Nada Lavrač and Peter Flach. An extended transformation approach to Inductive Logic Programming. Technical Report CSTR-00-002, Department of Computer Science, University of Bristol, March 2000.

    Google Scholar 

  10. Nada Lavrač, Dragan Gamberger, and Peter Turney. A relevancy filter for constructive induction. IEEE Intelligent Systems, 13(2):50–56, 1998.

    Article  Google Scholar 

  11. Stephen Muggleton. Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13(3–4):245–286. 1995.

    Google Scholar 

  12. Stephen Muggleton and Cao Feng. Efficient Induction of Logic Programs. In S. Arikawa, S. Goto, S. Ohsuga, and T. Yokomori, editors, Proceedings of the First International Workshop on Algorithmic Learning Theory (ALT). Springer-Verlag/Ohmsha Publishers, 1990.

    Google Scholar 

  13. Ross Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.

    Google Scholar 

  14. Stefan Wrobel. An algorithm for multi-relational discovery of subgroups. In J. Komorowski and J. Zytkow, editors, Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD). Springer-Verlag, 1997.

    Google Scholar 

  15. Stefan Wrobel. Inductive Logic Progamming for Knowledge Discovery in Databases. In N. Lavrač and S. Džeroski, editors, Relational Data Mining. Springer-Verlag, Berlin, New York, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krogel, MA., Wrobel, S. (2001). Transformation-Based Learning Using Multirelational Aggregation. In: Rouveirol, C., Sebag, M. (eds) Inductive Logic Programming. ILP 2001. Lecture Notes in Computer Science(), vol 2157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44797-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44797-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42538-0

  • Online ISBN: 978-3-540-44797-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics