| 基于分解合并策略的属性约简算法 |
| |
| 引用本文： | 王俊祥,胡峰.基于分解合并策略的属性约简算法[J].计算机工程与应用,2008,44(11):161-164. |
| |
| 作者姓名： | 王俊祥 胡峰 |
| |
| 作者单位： | 1. 重庆文理学院,基础学院,重庆,402168
2. 重庆邮电学院,计算机科学与技术研究所,重庆,400065 |
| |
| 摘 要： | 在基于粗集理论的知识获取研究中,属性约简是最核心的工作之一。结合分治法的思想,从论域划分的角度将一个大的决策表分解成两个子决策表,并利用经典的属性约简算法计算两个子决策表的约简,在此基础上利用合并约简算法将这两个子决策表合并,并求出原问题的解。该方法为解决大数据集的属性约简提供了一个新的途径。实验说明了算法的有效性。
|
| 关 键 词： | 粗集 属性约简 条件类集 分治 |
| 文章编号： | 1002-8331(2008)11-0161-04 |
| 收稿时间： | 2007-7-31 |
| 修稿时间： | 2007年7月31日 |
Attribute reduction algorithm based on decomposition and merging strategy |
| |
| WANG Jun-xiang,HU Feng.Attribute reduction algorithm based on decomposition and merging strategy[J].Computer Engineering and Applications,2008,44(11):161-164. |
| |
| Authors: | WANG Jun-xiang HU Feng |
| |
| Affiliation: | 1.College of Fundamental Science，Chongqing University of Arts and Sciences，Chongqing 402168，China 2.Institute of Computer Science and Technology，Chongqing University of Posts and Telecommunications，Chongqing 400065，China |
| |
| Abstract: | In the research of knowledge acquisition based on rough set theory,attribute reduction is a key problem.In this paper,combining with the idea of divide and conquer method,an intact decision table is decomposed into two sub-decision table with same condition and decision attributes,according to partition of its universe.Then,attribute reduction results of the two sub-decision tables are computed in terms of classic attribute reduction algorithms.Finally,the two sub-decision tables are merged into the intact decision table by merging reduction algorithm presented,and the reduction process of original decision table is implemented.Experimental results demonstrate the validity of algorithms. |
| |
| Keywords: | rough set attribute reduction condition class set divided and conquer |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
