The Canonical Basis of Implicational System
Hui-Feng Shi, Qiang Hua, Bo Zhang · 2006
In this paper, using the closure of the Galois connection, two algorithm are proposed for computing all closed itemsets and their generators of a formal context. The canonical implications basis is a minimal no-redundant implication set from which all implications can be inferred by the Armstrong rules. The canonical basis relies on the particular sort itemsets called pseudo-closed itemsets of formal context are presented