| 一种基于Rough集的海量数据属性约简方法 |
| |
| 引用本文： | 胡峰,张杰,刘静,肖大伟.一种基于Rough集的海量数据属性约简方法[J].重庆邮电大学学报(自然科学版),2009,21(4):455-460. |
| |
| 作者姓名： | 胡峰 张杰 刘静 肖大伟 |
| |
| 作者单位： | 重庆邮电大学,计算机科学与技术研究所,重庆,400065 |
| |
| 基金项目： | 国家自然科学基金，重庆市自然科学基金重点项目，重庆市教育委员会科学技术研究项目 |
| |
| 摘 要： | 海量数据属性约简的研究是数据挖掘研究中的一个难点.已有的许多属性约简算法对于空间复杂度考虑得不够,导致了算法不能适应大数据集的约简处理.结合分治法,在给定属性序下,提出了基于分治策略的属性约简算法.利用该算法可以快速得到海量数据的属性约简结果.仿真实验结果说明了该算法的高效性.
|
| 关 键 词： | 粗集 数据挖掘 分治 属性约简 属性序 |
| 收稿时间： | 2009/3/25 0:00:00 |
Attribute reduction algorithm for huge data based on rough set theory |
| |
| HU Feng,ZHANG Jie,LIU Jing,XIAO Da-wei.Attribute reduction algorithm for huge data based on rough set theory[J].Journal of Chongqing University of Posts and Telecommunications,2009,21(4):455-460. |
| |
| Authors: | HU Feng ZHANG Jie LIU Jing XIAO Da-wei |
| |
| Institution: | Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, P. R. China |
| |
| Abstract: | The attribute reduction of huge data is a difficult problem in the research of data mining. At present, many attribute reduction algorithms lack consideration on space complexity, which makes them cannot adapt to the reduction of large data set. In this paper, an attribute reduction algorithm of ordered attributes was proposed based on the divide and conquer, and this algorithm can be used to deal with huge data reduction. Simulation results show the efficiency of the algorithm. |
| |
| Keywords: | rough set data mining divide and conquer attribute reduction attribute order |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文 |
