Skip to main content

Experiment Databases: A Novel Methodology for Experimental Research

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3933))

Abstract

Data mining and machine learning are experimental sciences: a lot of insight in the behaviour of algorithms is obtained by implementing them and studying how they behave when run on datasets. However, such experiments are often not as extensive and systematic as they ideally would be, and therefore the experimental results must be interpreted with caution. In this paper we present a new experimental methodology that is based on the concept of “experiment databases”. An experiment database can be seen as a special kind of inductive database, and the experimental methodology consists of filling and then querying this database. We show that the novel methodology has numerous advantages over the existing one. As such, this paper presents a novel and interesting application of inductive databases that may have a significant impact on experimental research in machine learning and data mining.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Raedt, L.: A perspective on inductive databases. SIGKDD Explorations 4(2), 69–77 (2002)

    Article  MathSciNet  Google Scholar 

  2. Džeroski, S., Lavrač, N. (eds.): Relational Data Mining. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  3. Meo, R., Psaila, G., Ceri, S.: An extension to SQL for mining association rules in SQL. Data Mining and Knowledge Discovery 2, 195–224 (1998)

    Article  Google Scholar 

  4. Peng, Y., Flach, P., Soares, C., Brazdil, P.: Improved dataset characterisation for meta-learning. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol. 2534, pp. 141–152. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Perlich, C., Provost, F., Siminoff, J.: Tree induction vs. logicstic regression: A learning curve analysis. Journal of Machine Learning Research 4, 211–255 (2003)

    MATH  Google Scholar 

  6. Pfahringer, B., Bensusan, H., Giraud-Carrier, C.: Meta-learning by landmarking various learning algorithms. In: Proceedings of the 17th International Conference on Machine Learning (ICML 2000), pp. 743–750. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blockeel, H. (2006). Experiment Databases: A Novel Methodology for Experimental Research. In: Bonchi, F., Boulicaut, JF. (eds) Knowledge Discovery in Inductive Databases. KDID 2005. Lecture Notes in Computer Science, vol 3933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733492_5

Download citation

  • DOI: https://doi.org/10.1007/11733492_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33292-3

  • Online ISBN: 978-3-540-33293-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics