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

基于最大概念的概念格增量构造算法
引用本文:余远,钱旭,钟锋,李晓瑞. 基于最大概念的概念格增量构造算法[J]. 计算机工程, 2009, 35(21): 62-64
作者姓名:余远  钱旭  钟锋  李晓瑞
作者单位:中国矿业大学机电与信息工程学院,北京,100083;中国矿业大学机电与信息工程学院,北京,100083;中国矿业大学机电与信息工程学院,北京,100083;中国矿业大学机电与信息工程学院,北京,100083
基金项目:教育部重点基金资助项目 
摘    要:针对增量概念格构造过程中,节点更新和生成元判定效率较低、边更新阶段的复杂度较高等问题,提出基于最大概念的概念格增量构造算法,通过跟踪与概念格中的概念具有相同真实内涵的最大概念,简化生成元的判断过程。该算法缩小了寻找新生节点父节点时的搜索范围,避免对生成元非必要边的判断,提高构造概念格的速度。复杂度分析结果表明,该算法的时间性能优于其他同类算法。

关 键 词:形式背景  概念格  增量算法  对象内涵
修稿时间: 

Increment Construction Algorithm for Concept Lattice Based on Maximal Concept
YU Yuan,QIAN Xu,ZHONG Feng,LI Xiao-rui. Increment Construction Algorithm for Concept Lattice Based on Maximal Concept[J]. Computer Engineering, 2009, 35(21): 62-64
Authors:YU Yuan  QIAN Xu  ZHONG Feng  LI Xiao-rui
Affiliation:(School of Mechanical Electronic and Information Engineering, China University of Mining and Technology, Beijing 100083)
Abstract:Aiming at the problems during construction process of increment concept lattices such as low efficiency of nodes updating and generation element judgement, this paper presents an increment construction algorithm for concept lattice based on maximal concept which reduces the judgement process of generation element by tracking the largest concept with same connotations of concepts in concept lattice. The algorithm limits the search space while searching the father node of a new generated node, avoids judging unnecessary borders of generation element and improves the speed of concept lattice construction. Complexity analysis results demonstrate that this algorithm has better time performance than other kindred algorithms.
Keywords:formal context  concept lattice  increment algorithm  object intension
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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