Title of article
Generalized domination in closure systems Original Research Article
Author/Authors
Anne Berry، نويسنده , , Eric SanJuan، نويسنده , , Alain Sigayret، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
21
From page
1064
To page
1084
Abstract
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.
Keywords
Propositional Horn functions , Finite closure systems , Graph theory , Functional dependencies , Prime implicates , Finite lattices
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886263
Link To Document