Skip to main content

Towards Clausal Discovery for Stream Mining

  • Conference paper
Inductive Logic Programming (ILP 2009)

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

Included in the following conference series:

Abstract

With the increasing popularity of data streams it has become time to adapt logical and relational learning techniques for dealing with streams. In this note, we present our preliminary results on upgrading the clausal discovery paradigm towards the mining of streams. In this setting, there is a stream of interpretations and the goal is to learn a clausal theory that is satisfied by these interpretations. Furthermore, in data streams the interpretations can be read (and processed) only once.

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 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.

References

  1. Aggarwal, C.C.: Data streams: models and algorithms. Springer, New York (2007)

    MATH  Google Scholar 

  2. Gaber, M.M., Zaslavsky, A., Krishnaswamy, S.: Mining data streams: a review. SIGMOD Record 34(2), 18–26 (2005)

    Article  Google Scholar 

  3. Valiant, L.G.: A theory of the learnable. Communications of the ACM 27(11), 1134–1142 (1984)

    Article  MATH  Google Scholar 

  4. De Raedt, L., Džeroski, S.: First order jk-clausal theories are PAC-learnable. Artificial Intelligence 70(1-2), 375–392 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. De Raedt, L., Dehaspe, L.: Clausal discovery. Machine Learning 26(2-3), 99–146 (1997)

    Article  MATH  Google Scholar 

  6. Flach, P.A., Lachiche, N.: Confirmation-guided discovery of first-order rules with Tertius. Machine Learning 42(1-2), 61–95 (2001)

    Article  MATH  Google Scholar 

  7. Arias, M., Khardon, R., Maloberti, J.: Learning horn expressions with LOGAN-H. Journal of Machine Learning Research 8, 549–587 (2007)

    Google Scholar 

  8. Dries, A., Nijssen, S., De Raedt, L.: Mining predictive k-CNF expressions. IEEE Transactions on Knowledge and Data Engineering (2009) (in preprint)

    Google Scholar 

  9. Dries, A., Rückert, U.: Adaptive concept drift detection. In: SIAM International Conference on Data Mining, May 2009, pp. 233–244. SIAM, Philadelphia (2009)

    Google Scholar 

  10. De Raedt, L.: Logical and Relational Learning. Springer, Heidelberg (2008)

    Book  MATH  Google Scholar 

  11. Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)

    MATH  Google Scholar 

  12. Blockeel, H., De Raedt, L., Jacobs, N., Demoen, B.: Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery 3, 59–83 (2000)

    Article  Google Scholar 

  13. De Raedt, L., Van Laer, W.: Inductive constraint logic. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS, vol. 997, pp. 80–94. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dries, A., De Raedt, L. (2010). Towards Clausal Discovery for Stream Mining. In: De Raedt, L. (eds) Inductive Logic Programming. ILP 2009. Lecture Notes in Computer Science(), vol 5989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13840-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13840-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13839-3

  • Online ISBN: 978-3-642-13840-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics