期刊文献+

基于广义重要度和runner-root算法的特征选择 被引量:1

Feature selection based on general importance and runner-root algorithm
在线阅读 下载PDF
导出
摘要 特征选择是机器学习、模式识别和数据挖掘等领域数据预处理阶段的重要步骤。现实中采集的数据维度很高,存在大量冗余和噪声数据,这使得计算时间增加的同时还会对建模结果产生误导性。结合属性子集的广义重要度和智能优化runner-root算法提出一种特征选择算法,用runner-root算法进行迭代寻优,用属性子集的广义重要度和所选特征子集的大小作为适应度函数,对所选特征子集进行评估,尽可能在整个样本空间内搜索出对决策重要的特征子集。实验结果表明,该算法可以选择出有效的特征子集,使分类模型得到较高的准确率。 Feature selection is an important step in the data preprocessing stage in machine learning,pattern recognition,data mining and other fields.In reality,the data information collected is of high dimension,and there are redundant data and noisy data,which will increase the calculation time and mislead the modeling results at the same time.Combined with the generalized importance of attribute subsets and the intelligent optimization runner-root algorithm,a feature selection algorithm is proposed.The method uses the runner-root algorithm for iterative optimization,and uses the generalized importance of attribute subsets and the size of the selected feature subsets as fitness functions to evaluate the selected feature subsets,so that the features that are important for decision making are searched out as far as possible in the entire sample space.The experimental results show that the proposed feature selection algorithm can select effective feature subsets and obtain higher accuracy on the classification model.
作者 吴尚智 徐丹丹 王旭文 夏宁 WU Shang-zhi;XU Dan-dan;WANG Xu-wen;XIA Ning(College of Computer Science & Engineering,Northwest Normal University,Lanzhou 730070,China)
出处 《计算机工程与科学》 CSCD 北大核心 2022年第4期723-729,共7页 Computer Engineering & Science
基金 国家自然科学基金(61561043) 甘肃省自然科学基金(1010RJZA011)。
关键词 智能优化 广义重要度 runner-root算法 特征选择 intelligent optimization general importance runner-root algorithm feature selection
  • 相关文献

参考文献3

二级参考文献20

  • 1Zdzislaw Pawlak.Rough set theory.Kunstliche Intelligenz,2001,15(3):38~39
  • 2Zdzislaw Pawlak,Jerzy W.Grzymala-Busse,Roman Slowinski,Wojciech Ziarko.Rough sets.Comm of ACM,1995,38(11):88~95
  • 3Dominik Slezak,Wojciech Ziarko.Variable precision bayesian rough set model.In:Proceedings of the 9th International Conference on Rough Sets,Fuzzy Sets,Data Mining and Granular Computing.Chongqing,China,Springer Press,2003.312~315
  • 4Kim D.Data classification based on tolerant rough set.Pattern Recognition,2001,34(8):1613~1624
  • 5Gupta P,Doermann D,DeMenthon D.Beam search for feature selection in automatic SVM defect classification.Pattern Recognition,2002,19(2):212~215
  • 6Zhou P L,Salah M,Mingins Christine.An effective parallel attribute reduct algorithm based on discernibility matrix.In:Proceedings of the International Conference on Information and Knowledge Engineering.Las Vegas,USA,CSREA Press,2003.693~701
  • 7Dominik Slezak,Wojciech Ziarko.Attribute reduction in the bayesian version of variable precision rough set model.Electronic Notes in Theoretical Computer Science,2003,82(4):1~11
  • 8吴尚智.基于粗糙集的一种属性值约简算法及其应用[J].计算机应用与软件,2009,26(2):263-265. 被引量:12
  • 9李伟生,易哲.基于遗传算法的粗糙集属性约简算法[J].微电子学与计算机,2010,27(3):71-74. 被引量:6
  • 10袁浩.基于量子蚁群算法的粗糙集属性约简方法[J].计算机工程与科学,2010,32(5):82-84. 被引量:8

共引文献49

同被引文献14

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部