| 一种快速的动态属性约简矩阵算法 |
| |
| 作者姓名： | 钱文彬 杨炳儒 徐章艳 李慧 |
| |
| 作者单位： | 1. 北京科技大学计算机与通信工程学院, 北京 100083; |
| |
| 基金项目： | 国家自然科学基金资助项S (61175048)科技部创新方法专项项目(2010IM020900)国家重点基础研究发展计划资助项目(2009CB522701)材料领域知识工程北京市重点实验审2012年度阶梯计划项目(NO.Z121101002812005)资助 |
| |
| 摘 要： | 针对实际决策表中对象动态变化的情况,首先引入简化决策表概念,剔除决策表中大量重复的对象,并构造了基于正区域的简化矩阵,有效地缩小了算法的搜索空间;然后从理论上阐述了基于简化矩阵的属性约简和基于矩阵的属性约简的一致性,并仅需扫描一遍简化矩阵便可求解出属性约简;最后在原属性约简的基础上,提出一种快速的动态属性约简矩阵算法.通过算例分析和实验对比验证了算法的有效性和可行性.
|
| 关 键 词： | 粗糙集理论 属性约简 矩阵算法 决策表 |
| 收稿时间： | 2011-12-12 |
Efficient algorithm for dynamic attribute reduction based on a matrix |
| |
| Affiliation: | 1. School of Computer and Communicaliori Engineering, University of Science and Technology Beijing, Beijing 100083, China;2. Beijing Key Laboratory of Knowledge Engineering for Materials Science, Beijing 100083, China;3. School of Computer Science and Information Engineering, Guangxi Normal University, Guilin 541004, China |
| |
| Abstract: | Objects in actual decision tables are often changed dynamically. Aiming at this problem, the concept of a simplified decision table is introduced firstly, and a large number of repeated objects are deleted. A simplified matrix based on the positive region is constructed, which can reduce the searching space. What's more, it is theoretically analyzed that the definition of attribute reduction based on the simplified matrix is equal to that based on the un-simplified matrix. The proposed method scans only once the simplified matrix and it can be effectively utilized to the old attribute reduction. On this condition, an efficient algorithm for dynamic attribute reduction based on a matrix was designed. Finally, an example and its experimental comparison were employed to illustrate the efficiency and feasibility of the proposed algorithm. |
| |
| Keywords: | |
|
| 点击此处可从《》浏览原始摘要信息 |
|
点击此处可从《》下载全文 |
|
