Skip to main content

Feature Selection for Propositionalization

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2534))

Abstract

Following the success of inductive logic programming on structurally complex but small problems, recently there has been strong interest in relational methods that scale to real-world databases. Propositionalization has already been shown to be a particularly promising approach for robustly and effectively handling larger relational data sets. However, the number of propositionalfeatures generated here tends to quickly increase, e.g. with the number of relations, with negative effects especially for the efficiency of learning. In this paper, we show that feature selection techniques can significantly increase the efficiency of transformation-based learning without sacrificing accuracy.

Parts of this work were done while the 2nd author was still at Magdeburg University.

http://www.cs.wisc.edu/∼dpage/kddcup2001/

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. S. Kramer, N. Lavrač, and P. A. Flach. Propositionalization Approaches to RelationalData Mining. In N. Lavrač and S. Džeroski, editors, Relational Data Mining. Springer, 2001.

    Google Scholar 

  2. M.-A. Krogel and S. Wrobel. Transformation-Based Learning Using Multirelational Aggregation. In C. Rouveirol and M. Sebag, editors, Proceedings of the Eleventh International Conference on Inductive Logic Programming (ILP). Springer, 2001.

    Google Scholar 

  3. N. Lavrač and P. A. Flach. An extended transformation approach to Inductive Logic Programming. ACM Transactions on Computational Logic, 2(4):458–494, 2001.

    Article  Google Scholar 

  4. H. Liu and H. Motoda. Feature Selection for Knowledge Discovery and Data Mining. Kluwer, 1998.

    Google Scholar 

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

    Google Scholar 

  6. I. H. Witten and E. Frank. Data Mining-Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krogel, MA., Wrobel, S. (2002). Feature Selection for Propositionalization. In: Lange, S., Satoh, K., Smith, C.H. (eds) Discovery Science. DS 2002. Lecture Notes in Computer Science, vol 2534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36182-0_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-36182-0_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00188-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics