THE CANONICAL BASIS OF IMPLICATIONAL SYSTEM

摘要：

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-closecd itemsets of formal context are presented.

关键词： Formal context closure operator implicational system closed itemset pseudo-closed

作者: HUI-FENG SHI QIANG HUA BO ZHANG

作者单位: College of Applied Math.and Phys., North China Electric Power University, Baoding 071003, China Faculty of Mathematics and Computer Science, Hebei University, B aoding 071002, China College of Basic Sciences, Agricultural University of Hebei, Baoding 071001, China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 1076-1081

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）