摘要
为了提高概念格生成的效率,证明了概念的生成及其插入位置只与最新生成的概念有关,与先前生成的大量概念无关。设计算法并编写程序,程序运行结果表明,在形式背景插入属性时,概念格中增加的新生概念数量较少,且不随概念格规模的增大而迅速增大,概念格生成时间明显缩短。
In order to improve concept lattice construction efficiency, it proves that concept generation and inserting place only relate to newly generated concept instead of the entire concepts in the lattice. Accordingly, it presents the algorithm and carries out experiments, which show that new concepts are few and don＇ t increase steadily with the growth of the lattice, and running time is reduced.
出处
《计算机工程与应用》
CSCD
2012年第26期17-21,共5页
Computer Engineering and Applications
基金
国家自然科学基金(No.60975033)
河南理工大学博士基金(No.B2011-102)
关键词
概念格
渐进式算法
最亲近子概念
新生概念
属性
concept lattice
incremental algorithm
most relative child concept
newborn concept
attribute
