计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (18): 40-44.

• 研究、探讨 • 上一篇    下一篇

一般二元关系下信息系统知识的粒度描述

徐伟华1,刘士虎1,张文修2   

  1. 1.重庆理工大学 数学与统计学院,重庆 400054
    2.西安交通大学 理学院,西安 710049
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-06-21 发布日期:2011-06-21

Granularity representation of knowledge in information system based on general binary-relation

XU Weihua1,LIU Shihu1,ZHANG Wenxiu2   

  1. 1.School of Mathematics and Statistics,Chongqing University of Technology,Chongqing 400054,China
    2.School of Science,Xi’an Jiaotong University,Xi’an 710049,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-06-21 Published:2011-06-21

摘要: 在一般二元关系下信息系统中通过引入关系划分函数,建立了系统的概率空间,从而避免了此类系统论域只能形成覆盖而不能构成划分的局限性。进一步给出了一般二元关系下信息系统的粒度描述,得到了其重要性质,并证明了此类系统中知识的代数表示与粒度描述是完全等价的。最后通过实例验证了该粒度描述的有效性,为信息系统知识表示的进一步研究奠定了一定的理论基础。

关键词: 一般二元关系, 粒度, 信息系统, 知识表示, 粗糙集

Abstract: Probability space is established by introducing a portion function in information system based on general binary-
relation,this avoids the limitations that systems based on general binary-relation can’t be seen as a partition but only a cover.Moreover,granularity representation of knowledge is proposed in information system based on general binary-relation,and some important properties are obtained.It can be proved that the algebra representation of knowledge is equal to the granularity representation of knowledge in information system.Finally,the validity is examined by two examples,and the proposed framework paves the road for the further study of knowledge representation in information system.

Key words: General binary-relation, Granularity, Information system, Knowledge representation, Rough set