| 邻域粗糙集的随机集成属性约简 |
| |
| 引用本文： | 沈林.邻域粗糙集的随机集成属性约简[J].延边大学理工学报,2019,0(1):49-54. |
| |
| 作者姓名： | 沈林 |
| |
| 作者单位： | ( 莆田学院 信息工程学院, 福建 莆田 351100 ) |
| |
| 摘 要： | 为了解决传统的辨识矩阵空间复杂度高,难以应用于大规模数据的问题,提出了一种基于随机抽样的属性约简算法.首先随机抽取多个小样本子集,以降低辨识矩阵的空间复杂度; 然后分别对每个样本子集进行属性约简,并计算每个属性子集的权重; 最后选择高权重的几个属性子集进行测试,找出精度最高的属性子集.实验结果证明,本文方法比传统辨识矩阵的占用空间降低2～3个数量级,并且精度与其基本相当.
|
| 关 键 词： | 邻域粗糙集 随机抽样 属性约简 集成 |
Random ensemble attribute reduction of neighborhood rough sets |
| |
| SHEN Lin.Random ensemble attribute reduction of neighborhood rough sets[J].Journal of Yanbian University (Natural Science),2019,0(1):49-54. |
| |
| Authors: | SHEN Lin |
| |
| Affiliation: | ( College of Information Engineering, Putian University, Putian 351100, China ) |
| |
| Abstract: | In order to solve the problem that the traditional identification matrix has high spatial complexity, and is difficult to be applied to large-scale data, an attribute reduction algorithm based on random sampling is proposed. Firstly, several small sample subsets are randomly extracted to decrease the spatial complexity of the identification matrix; Secondly, attribute reduction is performed for each sample subset, and the weight of each attribute subset is calculated. Finally, several attribute subsets with high weights are selected for testing to find out the most accurate attribute subset. The experimental results show that the proposed method can reduce the occupied space by 2 to 3 orders of magnitude than traditional identification matrix, and its accuracy is basically the same as that of the traditional identification matrix. |
| |
| Keywords: | neighborhood rough sets random sampling attribute reduction ensemble |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《延边大学理工学报》浏览原始摘要信息 |
|
点击此处可从《延边大学理工学报》下载全文 |
|
