首页 | 本学科首页   官方微博 | 高级检索  
     

一种概念格渐进式构造算法
引用本文:习慧丹.一种概念格渐进式构造算法[J].计算机工程与应用,2012,48(23):115-119.
作者姓名:习慧丹
作者单位:黔南民族师范学院 计算机科学系,贵州 都匀 558000
摘    要:概念格是形式概念分析理论的一种数据结构,它以独特优势在许多领域获得了广泛应用,如信息检索、软件工程、知识发现等,而概念格的构造效率问题是其应用的前提。相对传统算法需要遍历原始概念格中所有结点才能确定新概念的产生子的不足,减少了概念格更新过程中需遍历的概念结点数并缩小了新概念的产生子的父概念的搜索范围,提高和改善了效率。

关 键 词:概念格  形式概念分析  渐进式算法  

Incremental construction algorithm for concept lattice
XI Huidan.Incremental construction algorithm for concept lattice[J].Computer Engineering and Applications,2012,48(23):115-119.
Authors:XI Huidan
Affiliation:Department of Computer Science, Qiannan Normal College for Nationalities, Duyun, Guizhou 558000, China
Abstract: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.
Keywords:concept lattice  formal concept analysis  increment algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号