Closed Association Rules

Szathmáry, László (2020) Closed Association Rules. Annales Mathematicae et Informaticae, 51. pp. 65-76. ISSN 1787-6117

Preview

Text 65_76_Szathmáry.pdf - Published Version Download (784kB) | Preview

Abstract

In this paper we present a new basis for association rules called Closed Association Rules (CR). This basis contains all valid association rules that can be generated from frequent closed itemsets. CR is a lossless representation of all association rules. Regarding the number of rules, our basis is between all association rules (AR) and minimal non-redundant association rules (MNR), filling a gap between them. The new basis provides a framework for some other bases and we show that MNR is a subset of CR. Our experiments show that CR is a good alternative for all association rules. The number of generated rules can be much less, and beside frequent closed itemsets nothing else is required.

Actions (login required)

Edit Item