基于同义概念的概念格纵向合并算法  

Vertical union algorithm of concept lattices based on synonymous concept

作　　者：张磊[1] 沈夏炯[1] 韩道军[1] 安广伟[1] 

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

出　　处：《计算机工程与应用》2007年第2期95-98,195,共5页Computer Engineering and Applications

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

摘　　要：在FCA中,如何提高概念格构造算法的效率一直是研究的重点之一。将形式背景进行分解后造格是解决这一问题的有效途径,其中概念格的合并算法是关键。提出同义概念的观点,在格的合并算法中引入了概念格的线性索引结构,通过寻找同域概念格之间的同义概念,根据父概念-子概念的关系实现对其所有父节点的快速更新。实验表明,该算法和文献中的同域概念格纵向合并算法相比,其时间性能有明显改善。One of the research emphases in the formal concept analysis field is how to improve the efficiency of constructing a concept lattice from a formal context.An efficient solution to this problem is to construct a parallel algorithm after dividing the formal context.A linear index structure of the concept lattice is introduced in the lattice union algorithm,which is to update each father node according to the general-special relation between the concepts by finding out the synonymous concepts of the common universe concept lattices.Comparing to the common universe concept lattice Vertical Union algorithms proposed in other papers,this algorithm makes great improvement in time complexity.

关 键 词：同域概念格 并行构造 纵向合并 同义概念 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]