基于概念内涵最小生成子的伪内涵计算方法

 伪内涵是形式概念分析理论的一个重要概念,伪内涵问题的研究是当前研究的热点.传统的伪内涵计算方法为了获得形式背景中所有的伪内涵,需要搜索形式背景中所有的非内涵属性集,而属性的组合容易导致搜索空间爆炸.为此,本文从概念内涵生成子的角度,刻画伪内涵的特性,给出伪内涵判定的充要条件;在此基础上,提出计算伪内涵的GPI算法.GPI算法只需对概念内涵的最小生成子进行计算,便可获得形式背景中所有的伪内涵,有助于缩减算法的搜索空间,提高伪内涵计算效率.理论分析和实验结果表明,本文的算法是有效可行的.

Generating All Pseudo-Intents with Minimal Generators of Formal Concept

Pseudo-intent is one of the significant notions of formal concept analysis.Pseudo-intents of formal contexts have gained interest in recent years,since this notion is helpful for finding minimal representations of implicational theories.In order to obtain all pseudo-intents from a given formal context,the existing approaches need to examine all combinations of attributes,which are not intents of formal concepts.However,the number of attribute combinations can be exponential in the number of attributes,which...