计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (1): 42-44.DOI: 10.3778/j.issn.1002-8331.2009.01.012

• 理论研究 • 上一篇    下一篇

概念格的内涵缩减研究

智东杰1,智慧来2,刘宗田2   

  1. 1.河南理工大学 计算机科学与技术学院,河南 焦作 454010
    2.上海大学 计算机工程与科学学院,上海 200072
  • 收稿日期:2008-08-26 修回日期:2008-10-29 出版日期:2009-01-01 发布日期:2009-01-01
  • 通讯作者: 智东杰

Research on concept lattice’s intent reduction

ZHI Dong-jie1,ZHI Hui-lai2,LIU Zong-tian2   

  1. 1.School of Computer Science and Technology,He’nan Polytechnic University,Jiaozuo,Henan 454010,China
    2.School of Computer Engineering and Science,Shanghai University Shanghai 200072,China
  • Received:2008-08-26 Revised:2008-10-29 Online:2009-01-01 Published:2009-01-01
  • Contact: ZHI Dong-jie

摘要: 利用概念格作为属性约简的数据模型,对概念格上的父子关系和内涵属性来源进行了分析:在概念格中任意若干个概念如果存在共同的子概念,那么只存在一个共同的子概念;概念的属性有两种来源,其一是继承的父节点的属性,其二是概念细化过程中增加的属性。相应地提出了两条内涵缩减的规则:如果一个节点只有一个父节点,那么其内涵缩减来源于它的内涵与父节点内涵的差集;如果一个节点有两个或两个以上的父节点,那么其内涵缩减来源于任意两个父亲节点属性的并集。然后对两条规则进行了证明,并设计了计算内涵缩减的算法。

关键词: 概念格, 内涵缩减, 关联规则

Abstract: Concept lattice is used as attribute reduction data model.The relationship between father concept and son concept and sources of attributes are studied separately.If several concepts have common son concept,the son concept is only one.Concept lattice nodes’ attributes have two sources that include inherited attributes from its father concept and new adopted attributes in the process of refining its father concept.Accordingly,two rules for intent reduction are proposed.If a concept node has only one father concept node,then the intent reduction is formed by the difference sets of its attributes set and its father’s attribute set.If a concept has several father concepts,then the intent reduction is formed by two attributes inherited from any two different fathers.Then,these two rules are formally proved.Finally,algorithm for computing intent reduction is put forward.

Key words: concept lattice, intent reduction, association rule