Keywords rough sets;induction;core;discernible matrix;soft sets; 粗糙集;约简;核;可辨识矩阵;软集合;
基于1个网页-相关网页
discernible Boolean matrix 可辨识布尔矩阵
The existing attribute reduction algorithms,including the one based on discernible matrix,the one based on the importance of attributes and the one based on frequency of attributes,are all introduced and analyzed in detail.
属性约简算法主要介绍和分析了基于差别矩阵的属性约简算法、基于属性重要性的属性约简算法和基于属性频度的属性约简算法。
参考来源 - 粗糙集理论约简算法及其应用研究Based on the important degree of condition attributes and discernible matrix, an effective condition attributes reduction is obtained.
本文根据条件属性的重要度和区分矩阵来进行条件属性约简,找出有效约简。
参考来源 - 基于粗糙集的流网络和决策算法研究This algorithm has no demand on the construction of discernible matrix,and has much less time and space complexities.
该算法不需要建立分辨矩阵,具有较低的时间复杂度和空间复杂度。
参考来源 - 一种基于区分链表的决策系统求核算法·2,447,543篇论文数据，部分数据来源于NoteExpress
Firstly, it deals with the data of information system and create the binary discernible matrix.
首先对信息系统的数据加工泛化，构造其二进制可辨矩阵。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
Since it doesn't need to generate the medial link of discernible matrix, so it can spare space and time, and raise the efficiency of the program run.
由于不用生成分明矩阵的中间环节，这样便节省了空间和时间，提高了运行效率。
应用推荐