Elimination of Redundant Association Rules - Université de La Réunion Access content directly
Conference Papers Year : 2019

Elimination of Redundant Association Rules

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-MGK.
No file

Dates and versions

hal-02456295 , version 1 (27-01-2020)

Identifiers

  • HAL Id : hal-02456295 , version 1

Cite

Bemarisika Parfait, Totohasina André. Elimination of Redundant Association Rules. 40th Anniversary International Conference Information Systems Architecture and Technology, Sep 2019, Wroclaw, Poland. pp.208-218. ⟨hal-02456295⟩

Collections

UNIV-REUNION
43 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More