| AddConcept:自顶向下的概念格横向合并算法 |
| |
| 引用本文： | 吕灵灵,张磊.AddConcept:自顶向下的概念格横向合并算法[J].北京邮电大学学报,2012,35(4):124-128. |
| |
| 作者姓名： | 吕灵灵 张磊 |
| |
| 作者单位： | 华北水利水电学院电力学院,郑州,450011;哈尔滨工业大学计算机科学与技术学院,哈尔滨,150001 |
| |
| 基金项目： | 国家重点基础研究发展计划项目(2011CB302605);国家自然科学基金项目(31101085);华北水利水电学院高层次人才科研启动项目(201013) |
| |
| 摘 要： | 提出了一种自顶向下、深度优先的概念格横向合并算法.首先研究了父子概念插入顺序对新生概念和更新概念的影响,并证明了概念插入和更新的相关定理.在此基础上,设计了一种递归插入概念的遍历顺序,能够大幅缩小概念比较的范围.实验和分析均表明,与其他概念格合并算法相比,该算法效率明显提高,适合概念格的合并运算.
|
| 关 键 词： | 概念格 横向合并 自顶向下 分布式构造 |
| 收稿时间： | 2011-06-27 |
AddConcept:A Top-Down Algorithm for Horizontal Merger of Concept Lattices |
| |
| L Ling-ling
,
ZHANG Lei.AddConcept:A Top-Down Algorithm for Horizontal Merger of Concept Lattices[J].Journal of Beijing University of Posts and Telecommunications,2012,35(4):124-128. |
| |
| Authors: | L Ling-ling ZHANG Lei |
| |
| Affiliation: | 1.Electric Power College, North China Institute of Water Conservancy and Hydroelectric Power 2.School of Computer Science and Technology, Harbin Institute of Technology |
| |
| Abstract: | A top-down and depth-first algorithm is proposed for horizontally merging concept lattices.The influences of the inserting order of the parents/children concepts on new concepts and updated concepts are investigated.Some theorems on inserting and updating concepts are proved.Based on this,a recursive traversal order is designed to insert concepts into lattices,which can drastically reduce the number of concepts comparisons.Experiment and analysis indicate that the proposed algorithm can obviously improve efficiencies compared with other concept lattices merging algorithms. |
| |
| Keywords: | concept lattice horizontal merger top-down distributed construction |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
