摘要
单向Sp-粗集中,具有属性集α的知识[x](R-元素等价类[x])具有这样的特征:若α内被补充属性,则[x]内的元素个数被减少。利用这一特征,考虑属性补充的随机性,给出Sp-上阶梯知识,Sp-上阶梯知识的依信度生成,Sp-上阶梯知识属性依赖的原理,给出Sp-上阶梯知识的属性依赖挖掘定理,Sp-上阶梯知识的状态识别算法。
In one direction Sp-rough sets,the knowledge [x]（R-element equivalence class [x]） with the attribute set α has such characteristic：If there are new attributes supplemented to α,then the elements in [x] will decrease;By using these characteristics and considering the reliability characteristics of the element transference random,the concepts of Sp-upper ladder knowledge,the generation of depending on reliability of Sp-upper ladder knowledge,and attribute dependence of Sp-upper ladder knowledge are presented.Attribute dependence mining theorem of Sp-upper ladder knowledge,and attribute dependence algorithm are also given.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第1期45-47,共3页
Computer Engineering and Applications
基金
河南省基础与前沿技术研究重点资助项目(No.082300410040)
河南省教育厅自然科学研究基金(No.2008C120002)
关键词
Sp-上阶梯知识
属性依赖
依信度生成
依赖挖掘
单位圆定理
状态识别
挖掘算法
Sp-upper ladder knowledge
attribute dependence
generation of depending on reliability
dependence mining
unit circle theorem
state recognition
mining algorithm
