Galois lattices and bases for MGK-valid association rules

Authors:
Jean Diatta;Daniel R. Feno;A. Totohasina
Affiliations:
IREMIA, Université de La Réunion, Messag Cedex 9, France;IREMIA, Université de La Réunion, Messag Cedex 9, France and ENSET, Université d'Antsiranana, Antsiranana, Madagascar;ENSET, Université d'Antsiranana, Antsiranana, Madagascar
Venue:
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Year:
2006

Citing 7
Cited 1

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices

Information Systems
Levelwise Search and Borders of Theories in KnowledgeDiscovery

Data Mining and Knowledge Discovery
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey

Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Efficient mining of both positive and negative association rules

ACM Transactions on Information Systems (TOIS)

Computing Implications with Negation from a Formal Context

Fundamenta Informaticae - Concept Lattices and Their Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We review the main properties of the quality measure MGK, which has been shown to be the normalized quality measure associated to most of the quality measures used in the data mining literature, and which enables to handle negative association rules. On the other hand, we characterize bases for MGK-valid association rules in terms of a closure operator induced by a Galois connection. Thus, these bases can be derived from a Galois lattice, as do well known bases for Confidence-valid association rules.