同义概念格的纵向合并  

Vertical Union of the Synonymy Concept Lattices

作　　者：臧国轻[1] 沈夏炯[1] 李国雁[1] 王鸿铭[1] 

机构地区：[1]河南大学计算机与信息工程学院,河南开封475001

出　　处：《计算机工程与科学》2008年第3期149-152,共4页Computer Engineering & Science

基　　金：河南省自然科学基金资助项目(0311011700)

摘　　要：由于概念格自身的完备性,构造效率一直是制约其进一步应用的瓶颈。本文从概念格的构造入手,提出了同义概念格的观点,并利用其性质进一步提出了一种纵向合并同义概念格的算法(VUSCL算法)。实验表明,随着节点数的增加,该算法与文献[8]中的纵向合并算法相比,其时间性能有明显改善。Because of the completeness of concept lattice, the efficiency of building concept lattices is always a bottleneck restricting the next application. Starting with the building of concept lattices, the paper introduces the opinion of synonymy concept lattice. Applying the characteristics of the synonymy concept lattice, the paper proposes an algorithm of the vertical union of synonymy concept lattices（VUSCL）. The test results show that the algorithm makes better improvement in time complexity than the other vertical union algorithms found in the related literatures when the number of nodes increases.

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

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]