北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2012, Vol. 35 ›› Issue (4): 124-128.doi: 10.13190/jbupt.201204.124.lüll

• 研究报告 • 上一篇    

Addconcept:自顶向下的概念格横向合并算法

吕灵灵1,张磊2   

  1. 1.华北水利水电学院 电力学院 2.哈尔滨工业大学 计算机科学与技术学院
  • 收稿日期:2011-06-27 修回日期:2012-02-16 出版日期:2012-08-28 发布日期:2012-07-08
  • 通讯作者: 吕灵灵 E-mail:lingling_lv@163.com
  • 作者简介:吕灵灵(1983-),女,讲师,博士,E-mail:lingling_lv@163.com
  • 基金资助:

    家重点基础研究发展计划项目(2011CB302605);国家自然科学基金项目(31101085);华北水利水电学院高层次人才科研启动项目(201013)

Addconcept:A Top-Down Algorithm for Horizontal Merger of  Concept Lattices

Lu Ling-ling1,ZHANG Lei2   

  1. 1.Electric Power College, North China Institute of Water Conservancy and Hydroelectric Power 2.School of Computer Science and Technology, Harbin Institute of Technology
  • Received:2011-06-27 Revised:2012-02-16 Online:2012-08-28 Published:2012-07-08
  • Contact: Ling-Ling Lv E-mail:lingling_lv@163.com
  • Supported by:

    ;the National Natural Science Foundation of China

摘要:

提出了一种自顶向下、深度优先的概念格横向合并算法. 首先研究了父子概念插入顺序对新生概念和更新概念的影响, 并证明了概念插入和更新的相关定理. 在此基础上,设计了一种递归插入概念的遍历顺序, 能够大幅缩小概念比较的范围. 实验和分析均表明,与其他概念格合并算法相比,该算法效率明显提高,适合概念格的合并运算. 

关键词: 概念格, 横向合并, 自顶向下, 分布式构造

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.

Key words: concept lattice, horizontal merger, top-down, distributed construction

中图分类号: