摘要
对形式概念分析中如何从概念格提取出形式背景的完备的无冗余的蕴涵规则集进行了研究,从数学理论上证明了通过求出的概念格中的每个概念的真内涵缩减集可以得到形式背景的完备的蕴涵规则集,提出了如何再去除其中的冗余蕴涵得到形式背景的完备的无冗余的蕴涵集合的方法并从数学理论上证明了该方法的正确性,给出了一个从概念格得到形式背景的完备的无冗余的蕴涵规则集的算法。
The problem of how to extract a complete and non-redundant set of implication rules of a context from the concept lattice in Formal Concept Analysis is studied in this paper. It is proved theoretically that we can get a complete set of implication rules of a context from all proper intent reduction of each cocept in the concept lattice. A method of how to get a complete and non- redundant set of implication rules of a context by removing all redundant implication rules in the complete set of implication rules is proposed and the method is proved to be right theoretically. Finally, an algorithm for extracting a complete and non-redundant set of implication rules of a context from the concept lattice is presented.
出处
《电脑开发与应用》
2009年第8期1-3,6,共4页
Computer Development & Applications
基金
国家自然科学基金资助(60773133
70471003
60573074)
山西省自然科学基金资助(2007011040)
关键词
形式概念分析
概念格
内涵缩减
蕴涵规则
formal concept analysis, concept lattice, intent reduction, implication rule