基于粒计算的变形分明函数分析及属性约简证明.pdfVIP

广西大学学报:自然科学版 VoL 34 No.5 第 34 卷第5 期 2α19 年 10 月 Joumal of Guangxi University:Nat Sci Ed OCl2α 文章编号:1∞1-7445(2仅用)05舶58-05 基于粒计算的变形分明函数分析及属性约简证明 闰林1 ，刘清2 (1.河南师范大学计算机与信息技术学院，河南新乡 453∞7;2. 南昌大学计算机科学系，江西南昌 33∞29) 摘要:为了对分明矩阵和分明函数属性约简法予以理论上的证明，一个变型的分明函数被构造，它被定义为析 取范式的逻辑公式。通过对变型分明函数以及等价转换成的最简式对应粒性质的讨论，证明了变型分明函数 对应的粒等于所有分明关系的并。由此证明了最简式中所有的合取项就是信息系统属性集的全部约简。从 而以粒计算的方法完成了分明知:阵和分明函数属性约简法的理论证明。 关键词:变形分明的数;分明属性子集;非吸收式;最简式 中图分类号:TP18 文献标识码:A Analysis on new discernibility function and proof about attribute reduction based on granular computing YAN Lin 1 , UU Qin矿 (1. Colle再;e of Computer and Information Technology , Henan Normal University , Xinxiang 453∞7 ， China; 2. Department of Computer Science , Nanchang University , Nanchang 33∞29 ， China) Abstract: In order to make a proof for the attribute reduction completed by the discemibility matrix and function , a new discemibility function which is defined 幽 a disjunctive normal form is construc- ted. By investigating granules corresponding to the new discernibility function ，副 well 臼 to 出e most succinct formula which is transformed from the new discemibility function , it is concluded that the granule corresponding to the new discemibility function is equal to the union of all discemibility rela- tions. Consequently , it proves that all conjunctive items of the most succinct formula are all reduc- tioos of the attribute set in the information system. 50 , based 00 granular computing , the theoretical proof for the attribute reduction determined by the discernibility matrÍx and function is completed.