Skip to main content

Mining Association Rules with Rough Sets

  • Chapter
  • First Online:

Part of the book series: Studies in Computational Intelligence ((SCI,volume 5))

Abstract

We say that there is an association between two sets of items when the sets are likely to occur together in transactions. In information retrieval, an association between two keyword sets means that they co-occur in a record or document. In databases, an association is a rule latent in the databases whereby an attribute set can be inferred from another.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Da Ruan Guoqing Chen Etienne E. Kerre Geert Wets

Rights and permissions

Reprints and permissions

About this chapter

Cite this chapter

Bell, D., Guan, J., Liu, D. Mining Association Rules with Rough Sets. In: Ruan, D., Chen, G., E. Kerre, E., Wets, G. (eds) Intelligent Data Mining. Studies in Computational Intelligence, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11004011_8

Download citation

  • DOI: https://doi.org/10.1007/11004011_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26256-5

  • Online ISBN: 978-3-540-32407-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics