A new Informative Generic Base of Association Rules

The problem of the relevance and the usefulness of extracted association rules is becoming of primary importance, since an overwhelm- ing number of association rules may be derived from even reasonably sized real-life databases. In this paper, we introduce a novel generic base of association rules, based on the Galois connection semantics. The novel generic base is sound and informative. We also present a sound axiomatic system, allowing to derive all association rules that can be drawn from an extraction context.

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

[2]  David J. Hand,et al.  Pattern Detection and Discovery , 2002, Pattern Detection and Discovery.

[3]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[4]  Engelbert Mephu Nguifo,et al.  Emulating a cooperative behavior in a generic association rule visualization tool , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

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

[6]  Jaideep Srivastava,et al.  Selecting the right interestingness measure for association patterns , 2002, KDD.

[7]  Mohammed J. Zaki Generating non-redundant association rules , 2000, KDD '00.

[8]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[9]  Engelbert Mephu Nguifo,et al.  Approches d'extraction de règles d'association basées sur la correspondance de Galois , 2004, Ingénierie des Systèmes d Inf..

[10]  Yves Bastide,et al.  Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis , 2001, KI/ÖGAI.

[11]  Gerd Stumme,et al.  Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets , 2000, Computational Logic.

[12]  Rokia Missaoui,et al.  Mthodes de Classification Conceptuelle Bases sur les Treillis de Galois et Applications , 1995 .

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

[14]  Engelbert Mephu Nguifo,et al.  Revisiting Generic Bases of Association Rules , 2004, DaWaK.

[15]  Sadok Ben Yahia,et al.  Découverte des règles associatives non redondantes - Application aux corpus textuels , 2003, EGC.

[16]  Nicolas Pasquier,et al.  Pruning closed itemset lattices for associations rules , 1998, BDA.

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