摘要
现有的渐进式概念格构造算法,不能有效利用已有的概念格。当形式背景的属性数目发生变化时,需要以单个属性或属性集合为对象,重新构造概念格。为此,提出了一种基于已有概念格的概念格合并算法,对已有概念格做直积运算,通过直积格和总格的映射关系,自底向上直接构造出总概念格。这个算法适用于属性交集为空的形式背景的合并。
The present incremental building algorithms of concept lattices cannot make full use of the existed concept lattices. When the number of attribute in formal context changes, it is neeessary to rebuild a new lattice based on single attribute or a set of attribute. A new algorithm for incorporating concept lattices based on the existed concept lattices is presented. The "together lattice" is built from bottom to top by direct product operation on the existed concept lattices and the mapping relation between the direct product lattice of two existed concept lattices and the "together lattice". The algorithm is fit for the formal contexts in which attribute sets have no intersection.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第11期232-235,共4页
Computer Applications and Software
关键词
概念格
直积
形式背景
Concept lattice Direct product Formal context