期刊文献+

区间概念格的纵向合并算法 被引量:2

Vertical union algorithm of interval concept lattices
下载PDF
导出
摘要 为解决直接对不同形式背景的数据构建区间概念格后分别抽取关联规则会存在规则缺失的实际问题,必须首先对不同的区间概念格进行合并。为提高格结构的生成与合并效率,首先对区间概念格的渐进式生成算法进行改进,将概念分为存在概念、冗余概念和空概念,分别以结构体的形式存储;进一步,分析区间概念格中外延和内涵之间的二元关系,给出了区间概念格纵向合并的充分条件——区间概念格的一致性;讨论了内涵一致的概念在合并后分为六种情况,并给出相应的判定定理;应用广度优先原则,通过对原区间概念格节点内涵的类型判定及不同的处理方法,设计了一种区间概念格的纵向合并算法。最后,通过实例验证了算法的有效性和高效性。 To solve the practical problem that some rules may be lost when the association rules are extracted directly after the construction of interval concept lattice for the different formal context, the different interval concept lattices must be merged firstly. To improve the efficiency of lattice generating and consolidation, the incremental generation algorithm of interval concept lattice should be improved firstly, and then the concepts were stored in the form of structures which were divided into existence concepts, redundancy concepts and empty concepts. Secondly, the binary relation between extension and intension was analyzed and the sufficient condition of vertical merger, consistency of interval concept lattice, was defined. Thirdly the concepts which have consistent intension were divided into six kinds after merging and the corresponding decision theorem was given. In the end, based on the principle of breadth-first, a new vertical integration algorithm was designed through the type judgment and different processing methods of the concept lattice nodes in the original interval concept lattice. Finally, an application example verified the effectiveness and efficiency of the algorithm.
出处 《计算机应用》 CSCD 北大核心 2015年第11期3213-3217,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(61370168 61472340) 河北省科技厅条件建设项目(14960112D)
关键词 区间概念格 结构体 一致性 广度优先 纵向合并 interval concept lattice structure body consistency breadth-first vertical union
  • 相关文献

参考文献14

  • 1WILLE R. Restructuring lattice theory: an approach based on hierarchies of concepts[C]// Proceedings of the 7th International Conference on Formal Concept Analysis. Berlin: Springer-Verlag, 2009: 314-339.
  • 2GODIN R, MISSAOUI R, APRIL A. Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods [J]. International Journal of Man-Machine Studies, 1993, 38(5): 747-767.
  • 3COLE R, STUMME G. CEM: a conceptual email manager[C]// Proceedings of the 7th International Conference on Conceptual Structures. Berlin: Springer-Verlag, 2000: 438-452.
  • 4GANTER B, WILLE R. Formal concept analysis: mathematical foundations[M]. Berlin: Springer-Verlag, 1999: 53-85.
  • 5张继福,张素兰,郑链.加权概念格及其渐进式构造[J].模式识别与人工智能,2005,18(2):171-176. 被引量:16
  • 6杨海峰,张继福.粗糙概念格及构造算法[J].计算机工程与应用,2007,43(24):172-175. 被引量:16
  • 7刘保相,张春英.一种新的概念格结构——区间概念格[J].计算机科学,2012,39(8):273-277. 被引量:25
  • 8程学旗,靳小龙,王元卓,郭嘉丰,张铁赢,李国杰.大数据系统和分析技术综述[J].软件学报,2014,25(9):1889-1908. 被引量:741
  • 9Nature. Big data [EB/OL].(2012-10-02)[2015-03-17]. http://www. nature.com/news/specials/bigdata/index.html.
  • 10王元卓,靳小龙,程学旗.网络大数据:现状与展望[J].计算机学报,2013,36(6):1125-1138. 被引量:714

二级参考文献141

共引文献1721

同被引文献14

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部