Generalized Domination in Closure Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2006

Generalized Domination in Closure Systems

Résumé

In the context of extracting maximal item sets and association rules from a binary data base, the graph-theoretic notion of domination was recently used to characterize the neighborhood of a concept in the corresponding lattice. In this paper, we show that the notion of domination can in fact be extended to any closure operator on a finite universe and be efficiently encoded into propositional Horn functions. This generalization enables us to endow notions and algorithms related to Formal Concept Analysis with Horn minimization and minimal covers of functional dependencies in Relational Databases.
Fichier non déposé

Dates et versions

hal-00521931 , version 1 (29-09-2010)

Identifiants

  • HAL Id : hal-00521931 , version 1

Citer

Anne Berry, Eric Sanjuan, Alain Sigayret. Generalized Domination in Closure Systems. Discrete Applied Mathematics, 2006, 154 (7), pp 1037-1156. ⟨hal-00521931⟩
56 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More