不完备系统中基于优势关系的最优可信规则获取.pdfVIP

2009 年3 月第3M 小理微理计算机系统 Journs.l 01 Chinese Computer System嚣 Vol.30 No.3 2009 不完备系统中基于优势关系的最优可信规则获取 杨习贝飞扬静字1 ，具小俊2 ，於东率1 ，宋晓宁l l(离京凛工大学计算机科学与技术学院，江苏湾JiC 210090 气江南大学馆息工辍学院，江苏无锡 214036) 巴mail ， yangxibei@163. com 擒 要z 以具有遗量喜爱未知属樵锐约不完备商标馆.t拿钱为研究对象，根捺优势关朵，提出什序和停序是优可传统员1).给出磊 、予优势关悉的描述子的概念，翻此获得不完每目标仿息泉统中的外序和降F乎可仿规则.定义丁1..子T!分级碎的区分函捷生用以计 界对象的什序和降序约筒，从而获得什序和降序最优可仿规则，为从不觉备目标仿息系统中获取规则提供丁斯的11.论1..1:1: 与抗 术手段. 乡是键词:不完备目标稽患系统，t吃势央系$最优可铺规黯约简 中朋分类带: TP18 文献蹦识码:A 束院编唔;1000-1220(2009)03-0518-06 Mining Optimal Credible Rules in Incomplete Systems Based on Dominance Relation 1 2 l YANGXi巾暗jJ. YANG Jjng-yu • WU Xiao-jun • YU Dong-junl.SONG Xiao-ning I(Sc !wol 01 Cønpuur Scimce and TecAnology. Nanjing Uniwrsity 0/ Scimce and Technology. Nanjin 1l 210094. Chi，制〉 l(Sc!wol olln/or酬摇ion and Engineering. ‘fíanlP棚U础wsíty. 部F附Î 214036. CAi棚〉 ，也bstrad; In this paper , the incomplete objeetive information system in whieh a11 unknown values are eonsidered as 10st is deep1y ínvestígated. In such information system圃. the concepts of optíma1 credíble rules in terms of incre串串ing and decreasing preferences are proposed based on the domins.nce rel盘tion. To derive all credible rules from the incomplet曹 objective information 串ystem. the concept of descríptíons 串re presented. Furthermore , from the viewpoint of 油e disc配rnibilíty functÎons based on the díscernibility matrixes. the increasing and decreasing reduct串 of object器 can be worked out and as s result. the optimal credible rules are obtained. The research is meaningful both in the 出，eory and in appHcations for the acquisitíon of rules in the incom唰 plete objective information 嚣押在带m队 Key words :incomplete objective information system , domínance relat