Incremental Maintenance Of Association Rules Under Support Threshold Change
Mohamed Anis Bach Tobji, Mohamed Salah Gouider

TL;DR
This paper introduces an incremental maintenance algorithm for association rules that adapts to changes in support thresholds, enabling dynamic rule base updates.
Contribution
It presents the first algorithm capable of maintaining association rules efficiently under varying support thresholds.
Findings
Supports dynamic support threshold changes
Enables flexible and efficient rule maintenance
Improves over previous algorithms assuming fixed thresholds
Abstract
Maintenance of association rules is an interesting problem. Several incremental maintenance algorithms were proposed since the work of (Cheung et al, 1996). The majority of these algorithms maintain rule bases assuming that support threshold doesn't change. In this paper, we present incremental maintenance algorithm under support threshold change. This solution allows user to maintain its rule base under any support threshold.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Imbalanced Data Classification Techniques · Rough Sets and Fuzzy Logic
