Nothing Special   »   [go: up one dir, main page]

Skip to main content

Rough Sets and Association Rules — Which is Efficient?

  • Conference paper
Compstat

Abstract

We evaluate the rough set and the association rule method with respect to their performance and the quality of the produced rules. It is shown that despite their different approaches, both methods are based on the same principle and, consequently, must generate identical rules. However, they differ strongly with respect to performance. Subsequently an optimized association rule procedure is presented which unifies the advantages of both methods.

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

  • Agrawal, R. and Srikant, S. (1994). Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB’94, 487–499. Morgan Kaufmann.

    Google Scholar 

  • Delic, D. (2001). Data Mining - Abhängigkeitsanalyse von Attributen mit Assoziationsregeln und Rough Sets. MS thesis. Free University of Berlin, Institute of Applied Computer Science, Berlin, Germany.

    Google Scholar 

  • Jürgens, M. and Lenz, H.-J. (2001). Tree Based Indexes Versus Bitmap Indexes: A Performance Study. International Journal of Cooperative Information Systems, 10, 355–376.

    Article  Google Scholar 

  • Munakata, T. (1998). Rough Sets. In: Fundamentals of the New Artificial Intelligence, 140–182. New York: Springer-Verlag.

    Google Scholar 

  • Pawlak, Z. (1982). Rough Sets. Int. J. Computer and Information Sci, 11, 341–356.

    Article  MathSciNet  MATH  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

Delic, D., Lenz, HJ., Neiling, M. (2002). Rough Sets and Association Rules — Which is Efficient?. In: Härdle, W., Rönz, B. (eds) Compstat. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-57489-4_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57489-4_81

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1517-7

  • Online ISBN: 978-3-642-57489-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics