Closed-set-based Discovery of Bases of Association Rules

Details Closed-set-based Discovery of Bases of Association Rules Closed-set-based Discovery of Bases of Association Rules

2010-12-03

arxiv.org/abs/1012.0735v2

Revue des Nouvelles Technologies de l'Information RNTI-E-20 (2011), pages 635-646

Computer Science

Learning

Shorter version in: Ali Khenchaf and Pascal Poncelet (eds.), Extraction et gestion des connaissances (EGC'2011)

Scientific paper

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. We propose alternative complete generators and we extend the approach to an existing closure-aware basis similar to, and often smaller than, the representative rules, namely the basis B*.

Affiliated with

Also associated with

No associations

Rating

Closed-set-based Discovery of Bases of Association Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Closed-set-based Discovery of Bases of Association Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Closed-set-based Discovery of Bases of Association Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515188