Skip to main content

Extended Negative Association Rules and the Corresponding Mining Algorithm

  • Conference paper
Advances in Machine Learning and Cybernetics

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

Abstract

Recently, negative association rule mining has received some attention and proved to be useful. This paper proposes an extended form for negative association rules and defines extended negative association rules. Furthermore, a corresponding algorithm is devised for mining extended negative association rules. The extended form is more general and expressive than the three existing forms. The proposed mining algorithm overcomes some limitations of previous mining methods, and experimental results show that it is efficient on simple and sparse datasets when minimum support is high to some degree. Our work will extend related applications of negative association rules to a broader range.

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 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.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithm for Mining Association Rules. In: Proceedings of VLDB, pp. 487–499 (1994)

    Google Scholar 

  3. Brin, S., Motwani, R., Silverstein, C.: Beyond Market Basket: Generalizing Association Rules to Correlations. In: Proceedings of the ACM SIGMOD, pp. 256–276 (1997)

    Google Scholar 

  4. Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns Without Candidate Generation: A Frequent-pattern Tree Approach. Data Mining and Knowledge Discovery 8, 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  5. Pietracaprina, A., Zandolin, D.: Mining Frequent Itemsets Using Patricia Tries. In: Proceedings of IEEE FIMI (2003)

    Google Scholar 

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

    Google Scholar 

  7. Thiruvady, D.R., Webb, G.I.: Mining Negative Rules in Large Databases Using GRD. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 161–165. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Webb, G.I., Zhang, S.: Beyond Association Rules: Generalized Rule Discovery. In: Proceedings of KDD, pp. 14–17 (2002)

    Google Scholar 

  9. Wu, X., Zhang, C., Zhang, S.: Mining Both Positive and Negative Association Rules. In: Proceedings of ICML, pp. 658–665 (2002)

    Google Scholar 

  10. Wu, X., Zhang, C., Zhang, S.: Efficient Mining of Both Positive and Negative Association Rules. ACM Transactions on Information Systems 22(3), 381–405 (2004)

    Article  Google Scholar 

  11. Frequent Itemset Mining Dataset Repository, http://fimi.cs.helsinki.fi/data//

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gan, M., Zhang, M., Wang, S. (2006). Extended Negative Association Rules and the Corresponding Mining Algorithm. In: Yeung, D.S., Liu, ZQ., Wang, XZ., Yan, H. (eds) Advances in Machine Learning and Cybernetics. Lecture Notes in Computer Science(), vol 3930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11739685_17

Download citation

  • DOI: https://doi.org/10.1007/11739685_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33584-9

  • Online ISBN: 978-3-540-33585-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics