PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Closed-set-based discovery of representative association rules revisited.
José Balcázar and Cristina Tirnauca
In: Extraction et Gestion des Connaissances, 25-28 Jan 2011, Brest, France.


The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the "essential" or "representative" rules. We revisit the algorithm given by Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS 2189, 350-359) for mining representative rules. We show that its output is sometimes incomplete, due to an oversight in its mathematical validation, and we propose an alternative complete generator that works within only slightly larger running times.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7664
Deposited By:Cristina Tirnauca
Deposited On:17 March 2011