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

n阶形式背景核的构造算法
引用本文:安广伟,沈夏炯,张磊,贾培艳,张柯.n阶形式背景核的构造算法[J].计算机工程与设计,2007,28(7):1501-1503,1507.
作者姓名:安广伟  沈夏炯  张磊  贾培艳  张柯
作者单位:[1]河南大学计算机与信息工程学院,河南开封475004 [2]河南大学数据与知识工程研究所,河南开封475004
摘    要:基于n阶形式背景核的概念格同构生成是一种新的概念格获取方法.其中n阶形式背景核的构造是基础.根据n阶形式背景核的概念,提出了n阶形式背景核的基本算法,并通过限制冗余形式背景的生成,对算法进行了改进.最后经过实验,验证了改进算法相对基本算法效率更高.

关 键 词:概念格  形式概念分析  形式背景  形式背景基  形式背景核  形式背景  构造算法  kernel  algorithm  算法效率  改进算法  验证  实验  冗余  基本算法  方法  概念格  格同构
文章编号:1000-7024(2007)07-1501-03
修稿时间:2006-03-07

Construction algorithm of nth-order contexts kernel
AN Guang-wei,SHEN Xia-jiong,ZHANG Lei,JIA Pei-yan,ZHANG Ke.Construction algorithm of nth-order contexts kernel[J].Computer Engineering and Design,2007,28(7):1501-1503,1507.
Authors:AN Guang-wei  SHEN Xia-jiong  ZHANG Lei  JIA Pei-yan  ZHANG Ke
Affiliation:1. College of Computer and Information Engineering, Henan University, Kaifeng 475004, China; 2. Institute of Data and Knowledge Engineering, Henan University, Kaifeng 475004, China
Abstract:Isomorphic generating for concept lattice based on n^th-order contexts kernel is a new method to obtain concept lattice. The foundation of the algorithm is construction of n^th-order contexts kernel. In terms of the notion of n^th-order contexts kernel, a basic construction algorithm is proposed and the improvement is discussed by limiting number of redundant contexts. Finally, it validates the high efficiency between the improved algorithms and the basic algorithm on the time complexity.
Keywords:concept lattice  formal concept analysis  formal context  formal context base  formal context kernel
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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