| 二进制分辨矩阵在连续属性约简中的研究 |
| |
| 引用本文： | 杨云霞,杨占勇. 二进制分辨矩阵在连续属性约简中的研究[J]. 计算机与数字工程, 2012, 40(1): 19-20,24 |
| |
| 作者姓名： | 杨云霞 杨占勇 |
| |
| 作者单位： | 南京信息工程大学信息与控制学院 南京210044 |
| |
| 摘 要： | 针对二进制分辨矩阵无法处理连续型数据,提出一种基于邻域的改进二进制分辨矩阵及其属性约简方法。实验结果表明,与先数据离散化,后属性约简的方法相比,利用文中方法提取出的特征属性的分类能力更高。
|
| 关 键 词： | 粗糙集 分辨矩阵 连续属性约简 邻域 |
Binary Discernibility Matrix Continuous Attribute Reduction Research |
| |
| YANG Yunxia , YANG Zhanyong. Binary Discernibility Matrix Continuous Attribute Reduction Research[J]. Computer and Digital Engineering, 2012, 40(1): 19-20,24 |
| |
| Authors: | YANG Yunxia YANG Zhanyong |
| |
| Affiliation: | (College of Information and Control,Nanjing University of Information Science and Technology,Nanjing 210044) |
| |
| Abstract: | Binary discernibility matrix can not handle continuous data,so a neighborhood-based binary discernibility matrix and attribute reduction methods has been proposed.Experimental results show that,compare with the first discrete data,after the ttribute reduction methods,the atrributes which this menthod selected get higher classification ability. |
| |
| Keywords: | rough set discerniblity matrix continuous attribute reduction neighborhood |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
