摘要
概念格是形式概念分析理论的一种数据结构,它以独特优势在许多领域获得了广泛应用,如信息检索、软件工程、知识发现等,而概念格的构造效率问题是其应用的前提。相对传统算法需要遍历原始概念格中所有结点才能确定新概念的产生子的不足,减少了概念格更新过程中需遍历的概念结点数并缩小了新概念的产生子的父概念的搜索范围,提高和改善了效率。
Concept lattice is a data structure of formal concept analysis theory,which has been applied widely in many fields such as information retrieval,software engineering,knowledge discovery.The efficiency of concept lattice construction is a prerequisite of its application.Compared to the traditional algorithm,the algorithm reduces the number of nodes to traverse during the update process and limits the search space while searching the father node of a new generated node,which has better time performance.
出处
《计算机工程与应用》
CSCD
2012年第23期115-119,共5页
Computer Engineering and Applications
关键词
概念格
形式概念分析
渐进式算法
concept lattice
formal concept analysis
increment algorithm
