Skip to main content

Mining Association Rules with Negative Items Using Interest Measure

  • Conference paper
  • First Online:
Web-Age Information Management (WAIM 2000)

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

Included in the following conference series:

Abstract

In this paper, we analyze some potential problems in the existing mining algorithms on association rules. These problems are caused by only concerning about its support and confidence, while neglecting to what extent the rule will interest people. At the same time, the existing definition and mining algorithms of association rules does not take into account any negative items, therefore many valuable rules are lost. We hereby introduce the concepts of interest measure and negative item into the definition and evaluation system. Then we modify the existing algorithms so as to use interest measure to generate rules with negative items. At the end of this paper we analyze the new algorithm and prove it to be efficient and feasible.

This paper was funded by the National 863 Projects of China No. 863-306-ZT02-05-1.

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. Agrawal, R., Imielinski, T., Swami, A. N.: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference (1993) 207–216

    Google Scholar 

  2. Zhou, X., Zhu, Y., Shi, B.: A Method for Mining Association Rules Using Interest Measure. ICYCS (1999)

    Google Scholar 

  3. Zuo, W., Liu, J.: Mining Association Rules Involving Positive and Negative Attributes. NDBC (1999.8) 288–292

    Google Scholar 

  4. Piatetsky-Shapiro, G.: Discovery, Analysis, and Presentation of Strong Rules. Knowledge Discovery in Database. AAAI/MIT Press (1991) 229–248

    Google Scholar 

  5. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A. I.: Fast Discovery of Assoication Rules. In: Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press (1996) 307–328

    Google Scholar 

  6. Megiddo, N., Srikant, R.: Discovering Predictive Association Rules. KDD (1998) 274–278

    Google Scholar 

  7. Savasere, A., Omiecinski, E., Navathe, S. B.: Mining for Strong Negative Associations in a Large Database of Customer Transactions. ICDE (1998) 494–502

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, H., Gao, P., Zhu, Y. (2000). Mining Association Rules with Negative Items Using Interest Measure. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45151-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67627-0

  • Online ISBN: 978-3-540-45151-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics