Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rough Sets and Current Trends in Computing

RSCTC 1998: Rough Sets and Current Trends in Computing pp 214–222Cite as

Fast Discovery of Representative Association Rules

  • Conference paper
  • First Online:

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

Abstract

Discovering association rules among items in a large database is an important database mining problem. The number of association rules may be huge. To alleviate this problem, we introduced in [1] a notion of representative association rules. Representative association rules are a least set of rules that covers all association rules satisfying certain user specified constraints. The association rules, which are not representative ones, may be generated by means of a cover operator without accessing a database. In this paper, we investigate properties of representative association rules and offer a new efficient algorithm computing such rules.

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

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. Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD’ 98. Melbourne, Australia. Lecture Notes in Artificial Intelligence. Springer-Verlag (1998)

    Google Scholar 

  2. Agraval, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data. Washington, D.C. (1993) 207–216

    Google Scholar 

  3. Srikant, R., Agraval, R.: Mining Generalized Association Rules. In: Proc. of the 21st VLDB Conference. Zurich, Swizerland (1995) 407–419

    Google Scholar 

  4. Meo, R., Psaila, G., Ceri, S.: A New SQL-like Operator for Mining Association Rules. In: Proc. of the 22nd VLDB Conference. Mumbai (Bombay), India (1996)

    Google Scholar 

  5. Communications of the ACM, November 1996, Vol. 39. No 11. (1996)

    Google Scholar 

    Google Scholar 

  6. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California (1996)

    Google Scholar 

  7. Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. In: Piatetsky-Shapiro, G., Frawley, W. (eds.): Knowledge Discovery in Databases. AAAI/MIT Press, Menlo Park, CA (1991) 229–248

    Google Scholar 

  8. Agraval, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California [6]} (1996) 307–328

    Google Scholar 

  9. Savasere, A, Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. of the 21st VLDB Conference. Zurich, Swizerland (1995) 432–444

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Marzena Kryszkiewicz

Authors
  1. Marzena Kryszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-665, Warszawa, Poland

    Lech Polkowski

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kryszkiewicz, M. (1998). Fast Discovery of Representative Association Rules. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation