Closed-set-based Discovery of Representative Association Rules Revisited

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.

[1]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[2]  Marzena Kryszkiewicz,et al.  Fast Discovery of Representative Association Rules , 1998, Rough Sets and Current Trends in Computing.

[3]  Alexandra Silva,et al.  Non-Deterministic Kleene Coalgebras , 2010, Log. Methods Comput. Sci..

[4]  John F. Roddick,et al.  Association mining , 2006, CSUR.

[5]  Geert Wets,et al.  Using association rules for product assortment decisions: a case study , 1999, KDD '99.

[6]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[7]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[8]  Michael Luxenburger,et al.  Implications partielles dans un contexte , 1991 .

[9]  Dan A. Simovici,et al.  Generating an informative cover for association rules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[10]  Marzena Kryszkiewicz.  Concise Representations of Association Rules , 2002, Pattern Detection and Discovery.

[11]  Philip S. Yu,et al.  A New Approach to Online Generation of Association Rules , 2001, IEEE Trans. Knowl. Data Eng..

[12]  Jitender S. Deogun,et al.  Using Closed Itemsets for Discovering Representative Association Rules , 2000, ISMIS.

[13]  Marzena Kryszkiewicz,et al.  Representative Association Rules , 1998, PAKDD.

[14]  Viet Phan Luong.  The Representative Basis for Association Rules , 2001, ICDM.

[15]  H. Mannila,et al.  Discovering all most specific sentences , 2003, TODS.

[16]  Engelbert Mephu Nguifo,et al.  Succinct Minimal Generators: Theoretical Foundations and Applications , 2008, Int. J. Found. Comput. Sci..

[17]  Mohammed J. Zaki.  Mining Non-Redundant Association Rules , 2004, Data Min. Knowl. Discov..

[18]  Marzena Kryszkiewicz,et al.  Closed Set Based Discovery of Representative Association Rules , 2001, IDA.

[19]  José L. Balcázar,et al.  Transforming Outermost into Context-Sensitive Rewriting , 2010, Log. Methods Comput. Sci..

[20]  Rokia Missaoui,et al.  Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges , 2004, ICFCA.