| 基于属性的概念格渐进式构造原理与算法 |
| |
| 引用本文： | 智慧来,智东杰.基于属性的概念格渐进式构造原理与算法[J].计算机工程与应用,2012,48(26):17-21. |
| |
| 作者姓名： | 智慧来 智东杰 |
| |
| 作者单位： | 河南理工大学 计算机科学与技术学院,河南焦作,454150 |
| |
| 基金项目： | 国家自然科学基金，河南理工大学博士基金 |
| |
| 摘 要： | 为了提高概念格生成的效率,证明了概念的生成及其插入位置只与最新生成的概念有关,与先前生成的大量概念无关。设计算法并编写程序,程序运行结果表明,在形式背景插入属性时,概念格中增加的新生概念数量较少,且不随概念格规模的增大而迅速增大,概念格生成时间明显缩短。
|
| 关 键 词： | 概念格 渐进式算法 最亲近子概念 新生概念 属性 |
Theory and algorithm of concept lattice incremental construction based on attributes |
| |
| ZHI Huilai
,
ZHI Dongjie.Theory and algorithm of concept lattice incremental construction based on attributes[J].Computer Engineering and Applications,2012,48(26):17-21. |
| |
| Authors: | ZHI Huilai ZHI Dongjie |
| |
| Affiliation: | School of Computer Science and Technology,Henan Polytechnic University,Jiaozuo,Henan 454150,China |
| |
| Abstract: | 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. |
| |
| Keywords: | concept lattice incremental algorithm most relative child concept newborn concept attribute |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
