Skip to main content

Towards a Framework for Inductive Querying

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2006)

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

Included in the following conference series:

  • 1089 Accesses

Abstract

Despite many recent developments, there are still a number of central issues in inductive databases that need more research. In this paper we address two of them. The first issue is about how the discovery of patterns can use existing patterns. We will give a concrete example showing an advantage of mining both the patterns and the data. The second issue we consider is the actual implementation of inductive databases. We will propose an architectural framework for inductive databases and show how existing databases can be incorporated.

This research is carried out within the Netherlands Bio Informatics Consortium (NBIC) BioRange Project.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Bertino, E., Catania, B., Kotsifakos, E., Maddalena, A., Ntoutsi, I., Theodoridis, Y.: PBMS Querying and Storage Issues, PANDA Technical Report PANDA-TR-2004-02 (February 2004)

    Google Scholar 

  2. Bertino, E., Catania, B., Maddalena, A.: Towards a Language for Pattern Manipulation. In: Proc. 1st International Workshop on Pattern Representation and Management (PaRMa 2004), Greece (March 2004)

    Google Scholar 

  3. Borgelt, C.: Efficient Implementations of Apriori and Eclat. In: Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL). CEUR Workshop Proceedings 90, Aachen, Germany (2003), http://www.ceur-ws.org/Vol-90/

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

    Article  Google Scholar 

  5. Imielinski, T., Manilla, H.: A Database Perspective on Knowledge Discovery. Communications of the ACM 39(11), 58–64 (1996)

    Article  Google Scholar 

  6. Meo, R., Psaila, G.: Toward XML-Based Knowledge Discovery Systems. In: Proc. of the IEEE International Conference on Data Mining, Japan, pp. 665–668 (2002)

    Google Scholar 

  7. Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Department of Information and Computer Science, Irvine, CA (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

  8. Nijssen, S., Kok, J.N.: Multi-Class Correlated Pattern Mining. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol. 3933, Springer, Heidelberg (2006)

    Chapter  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

de Bruin, J.S. (2006). Towards a Framework for Inductive Querying. In: Esposito, F., RaÅ›, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_48

Download citation

  • DOI: https://doi.org/10.1007/11875604_48

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45766-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics