Skip to main content
SpringerLink
Log in

Elimination of Redundant Association Rules

  • Conference paper
  • First Online:
Book cover Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 2019 (ISAT 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1051))

  • 609 Accesses

Abstract

The redundancy concept has been developed of various approaches. However, these approaches concern only the positive association rules, the negative association rules are less studied, and this, with less selective pair, support-confidence. To do remedy these limits, we propose a new approach allowing to generate all non-redundant positive and negative rules, and this, using the new selective pair, support-\(M_{GK}\).

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and 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

Notes

  1. 1.

    For all \(X, Y\subseteq {\mathcal I}\), an association rule is negative if at least one two patterns is negative, of the form \(X\rightarrow \overline{Y}\), \(\overline{X}\rightarrow Y\) and \(\overline{X}\rightarrow \overline{Y}\), where \(\overline{{\mathcal A}}=\lnot {\mathcal A}={\mathcal I}\backslash {\mathcal A}\).

  2. 2.

    For the sake of simplification, we will write P(X) instead of \(P(t(X)),~\forall X\subseteq {\mathcal I}\).

  3. 3.

    http://www.almaden.ibm.com/cs/quest/syndata.html

  4. 4.

    ftp://ftp2.cc.ukans.edu/pub/ippbr/census/pums/pums90ks.zip

  5. 5.

    ftp://ftp.ics.uci.edu/pub/mach.-lear.-databases/mushroom/agaricus-lepiota.data

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference VLDB, pp. 487–499 (1994)

    Google Scholar 

  2. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. ACM-SIGKDD Explor. 2(2), 66–75 (2000)

    Article  Google Scholar 

  3. Bemarisika, P.: Extraction de règles d’association selon le couple support-\(M_{GK}\): graphes implicatifs et application en didactique des mathématiques. Université d’Antananarivo (2016)

    Google Scholar 

  4. Bemarisika, P., Totohasina, A.: Erapn, an algorithm for extraction positive and negative association rules in Big Data. In: DaWaK, pp. 329–344. Springer (2018)

    Google Scholar 

  5. Bemarisika, P., Totohasina, A.: An efficient approach for extraction positive and negative association rules from Big Data. In: CD-MAKE, pp. 79–97. Springer (2018)

    Google Scholar 

  6. Feno, D.R., Diatta, J., Totohasina, A.: Galois lattices and based for \(M_{GK}\)-valid association rules. In: Proceedings of the 4th International Conference on CLA’06, pp. 127–138 (2006)

    Google Scholar 

  7. Feno, D.R.: Mesure de qualité des règles d’association: Normalisation et caractérisation des bases. Ph.D. thesis, Université de La Réunion (2007)

    Google Scholar 

  8. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    Book  Google Scholar 

  9. Guigues, J.L., Duquenne, V.: Familles minimales d’implications informatives résultant d’un tableau de donnés binaires. Maths. et Sciences Humaines, pp. 5–18 (1986)

    Google Scholar 

  10. Kryszkiewicz, M.: Concise representations of association rules. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery, pp. 92–103 (2002)

    Google Scholar 

  11. Latiri, C., Haddad, H., Hamrouni, T.: Towards an effective automatic query expansion process using an association rule mining approach. J. Intell. Inf. Syst. 39(1), 209–247 (2012)

    Article  Google Scholar 

  12. Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Disc. 1(3), 241–258 (1997)

    Article  Google Scholar 

  13. Pasquier, N.: Frequent closed itemsets based condensed representations for association rules. CNRS (UMR6070), France, pp. 248–273 (2009)

    Chapter  Google Scholar 

  14. Séverac, F., et al.: Non-redundant association rules between diseases and medications: an automated method for knowledge base construction. Med. Inform. Decis. Mak. 15(1), 29 (2015)

    Article  Google Scholar 

  15. Zaki, M.J.: Mining non-redundant association rules. In: Proceedings of the Knowledge Discovery and Data Mining (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Mathématiques et d’Informatique, ENSET, Université d’Antsiranana, Antsiranana, Madagascar

    Bemarisika Parfait & Totohasina André

  2. Laboratoire d’Informatique et de Mathématiques, EA2525, Université de La Réunion, Saint-Denis, France

    Bemarisika Parfait

Authors
  1. Bemarisika Parfait
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Totohasina André
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bemarisika Parfait .

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Jerzy Świątek

  2. Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Leszek Borzemski

  3. University of Applied Sciences in Nysa, Nysa, Poland

    Zofia Wilimowska

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Parfait, B., André, T. (2020). Elimination of Redundant Association Rules. In: Świątek, J., Borzemski, L., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 2019. ISAT 2019. Advances in Intelligent Systems and Computing, vol 1051. Springer, Cham. https://doi.org/10.1007/978-3-030-30604-5_19

Download citation

Publish with us

Policies and ethics

Search

Navigation