检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姚晟[1,2] 徐风[1,2] 赵鹏[1,2] 纪霞[1,2] Yao Sheng;Xu Feng;Zhao Peng;Ji Xia(Key Laboratory of Intelligent Computing&Signal Processing(Anhui University),Ministry of Education,Hefei 230601;College of Computer Science and Technology,Anhui University,Hefei 230601)
机构地区:[1]计算智能与信号处理教育部重点实验室(安徽大学),合肥230601 [2]安徽大学计算机科学与技术学院,合肥230601
出 处:《计算机研究与发展》2018年第4期802-814,共13页Journal of Computer Research and Development
基 金:国家自然科学基金项目(61602004;61300057);安徽省自然科学基金项目(1508085MF127);安徽省高等学校自然科学研究重点项目(KJ2016A041;KJ2017A011);安徽大学信息保障技术协同创新中心公开招标课题(ADXXBZ2014-5;ADXXBZ2014-6);安徽大学博士科研启动基金项目(J10113190072)~~
摘 要:特征选择是数据预处理中一项很重要的技术,主要从原始数据集的特征中选出一些最有效的特征以降低数据集的维度,从而提高学习算法性能.目前基于邻域粗糙集模型的特征选择算法中,由于没有考虑数据分布不均的问题,对象的邻域存在一定的缺陷.为了解决这个问题,采用方差来度量数据的分布情况,重新定义二元邻域空间,基于此提出自适应二元邻域空间的粗糙集模型,并将该模型与邻域直觉模糊熵结合作为特征评估的方式,进而构造相应的特征选择算法.UCI实验结果表明:所提出的算法能够选出更小且具有更高分类精度的特征子集,同时算法拥有更少的时间消耗.因此所提的特征选择算法具有更强的优越性.Feature selection is a very vital technology in data preprocessing.In this method,some most effective features are mainly selected from the features of original data sets,which is aimed to reduce the dimension of data sets.Accordingly,the performance of the learning algorithm can be improved.In the feature selection algorithms based on the neighborhood rough set model,without considering data uneven distribution,there currently exist some defects in the neighborhood of object.To solve this problem of data uneven distribution,variance is adapted to measure the distribution of the data,and the binary neighborhood space is redefined,then the rough set model of the adaptive binary neighborhood space is proposed according to this binary neighborhood space.As well as,the new rough set model of the adaptive binary neighborhood space is combined with the neighborhood intuitionistic fuzzy entropy as the method of the evaluation of features,and then the corresponding feature selection algorithm is also constructed.The experimental results of UCI show that the proposed intuitionistic fuzzy entropy feature selection algorithm can select smaller feature subsets which have higher accuracy of classification,at the same time,the intuitionistic fuzzy entropy feature selection algorithm based on adaptive neighborhood space rough set model also has less time consumption.Therefore,the proposed feature selection algorithm has stronger superiority in this paper.
关 键 词:粗糙集 邻域 方差 二元邻域空间 邻域直觉模糊熵 特征选择
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38