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

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

作　　者：徐伟华[1] 刘士虎[1] 张文修[2] 

机构地区：[1]重庆理工大学数学与统计学院,重庆400054 [2]西安交通大学理学院,西安710049

出　　处：《计算机工程与应用》2011年第18期40-44,共5页Computer Engineering and Applications

基　　金：重庆市教委科技项目(No.KJ090612);重庆市九龙坡区科技项目(No.2008Q98)

摘　　要：在一般二元关系下信息系统中通过引入关系划分函数,建立了系统的概率空间,从而避免了此类系统论域只能形成覆盖而不能构成划分的局限性。进一步给出了一般二元关系下信息系统的粒度描述,得到了其重要性质,并证明了此类系统中知识的代数表示与粒度描述是完全等价的。最后通过实例验证了该粒度描述的有效性,为信息系统知识表示的进一步研究奠定了一定的理论基础。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 frame- work paves the road for the further study of knowledge representation in information system.

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

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]