• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2008, Vol. 30 ›› Issue (3): 149-152.

• 论文 • 上一篇    下一篇

同义概念格的纵向合并

臧国轻 沈夏炯 李国雁 王鸿铭   

  • 出版日期:2008-03-01 发布日期:2010-05-19

  • Online:2008-03-01 Published:2010-05-19

摘要:

由于概念格自身的完备性,构造效率一直是制约其进一步应用的瓶颈。本文从概念格的构造入手,提出了同义概念格的观点,并利用其性质进一步提出了一种纵向合并同义概 念格的算(VUSCL算法)。实验表明,随着节点数的增加,该算法与文献[8]中的纵向合并算法相比,其时间性能有明显改善。

关键词: 形式背景 同域概念格 纵向合并 同义概念格

Abstract:

Because of the completeness of concept lattice, the efficiency of building concept lattices is always a bottleneck restricting the next application. S tarting with the building of concept lattices, the paper introduces the opinion of synonymy concept lattice. Applying the characteristics of the synonym y concept lattice, the paper proposes an algorithm of the vertical union of synonymy concept lattices(VUSCL). The test results show that the algorithm m makes better improvement in time complexity than the other vertical union algorithms found in the related literatures when the number of nodes increases.

Key words: formal context, common universe concept lattice, vertical union, synonymy concept lattice