S_p-下阶梯知识挖掘及状态识别  

Mining of S_p-lower Ladder Knowledge and State Recognition

作　　者：刘若慧[1] 刘保仓[2] 

机构地区：[1]黄准学院计算机科学系,河南驻马店463000 [2]黄淮学院数学科学系,河南驻马店463000

出　　处：《模糊系统与数学》2011年第1期134-139,共6页Fuzzy Systems and Mathematics

基　　金：河南省基础与前沿技术研究重点项目(092300410146);河南省教育厅自然科学研究基金资助项目(2008C120002)

摘　　要：单向Sp-粗集中,具有属性集α的知识[x](R-元素等价类[x])具有这样的特征:若α内部分属性被删除,则[x]内的元素个数增加;利用这一特征,考虑属性被删除的随机性,给出Sp-下阶梯知识,Sp-下阶梯知识的依信度生成,Sp-下阶梯知识属性依赖的原理,给出Sp-下阶梯知识的属性依赖挖掘定理,Sp-下阶梯知识的状态识别算法。In one direction Sp-rough sets, the knowledge [χ] （R-element equivalence class [χ]） with the attribute set a has such characteristic： if there are some attributes in a be deleted, then the elements in [χ] will increase. By using these characteristics and consider the rejiablity characteristics of the element transference random, the concepts of Sp-lower ladder knowledge, the generation of depending on reliability of Sp-lower ladder knowledge, and attribute dependence of Sp-lower ladder knowledge are presented, attribute dependence mining theorem of Sp-lower ladder knowledge, and attribute dependence algorithm are also given.

关 键 词：Sp-下阶梯知识 属性依赖 依信度生成 依赖挖掘 状态识别 挖掘算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]