数据排列的上近似与数据识别  

Upper approximation and data recognition based on data arranging

作　　者：刘金金[1] 闫林[1] 李卓文[1] 

机构地区：[1]河南师范大学计算机与信息技术学院,河南新乡453007

出　　处：《计算机工程与应用》2012年第22期151-155,165,共6页Computer Engineering and Applications

基　　金：河南省自然科学基金(No.082300410340)

摘　　要：在传统信息系统中引入了n阶粒划分的概念,使信息系统通过n阶粒划分得以粒化,并随着n阶粒划分的变化呈现不同的粒化结构。进而,经对论域对象的特定排序,并通过对上近似和n阶粒划分的融合,确定了一种数据隐含与数据识别的方法,使在数据隐含与数据识别中具有独特的作用。通过调整论域对象的排列顺序,使得数据隐含与数据识别更具灵活性,达到了相同数据隐含及识别的多样性目的。Based on an information system, n-order-granule partitions are introduced in this paper, which make the information system achieve different granule＇ s degrees, so that granular structures are obtained. Furthermore, by ar- ranging elements of the universe with a special way, and after integrating n-order-granule partitions with upper ap- proximation, a data hiding and recognizing method is established, which plays an important role in this area. More- over, by adjusting the order of the elements of the universe, the data hiding and recognizing are more flexible. There- fore, data hide and recognition can be realized in variable ways.

关 键 词：n阶粒划分 上近似 数据识别 数据隐含 

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