首页 | 本学科首页   官方微博 | 高级检索  
     

动态模糊粗糙特征选取算法
引用本文:倪鹏,刘阳明,赵素云,陈红,李翠平.动态模糊粗糙特征选取算法[J].计算机科学与探索,2020,14(2):236-243.
作者姓名:倪鹏  刘阳明  赵素云  陈红  李翠平
作者单位:中国人民大学 数据工程与知识工程教育部重点实验室,北京 100872;中国人民大学 信息学院,北京 100872;中国人民大学 数据工程与知识工程教育部重点实验室,北京 100872
基金项目:国家重点研发计划Nos.2016YFB1000702,2017YFB1400700;国家自然科学基金Nos.61732006,61532021,61772536,61772537,61702522;国家社会科学基金No.12\&ZD220;重点大学基础研究基金,中国人民大学研究基金No.15XNLQ06;中国澳门科技发展基金No.081/2015/A3;高等学校学科创新引智计划(111计划))~~
摘    要:由于数据随时间和空间不断更新,很多基于粗糙集的增量方法被提出。然而,动态数据上基于模糊粗糙集的特征选取(也称属性约简)更新的研究较少,特别是连续型动态数据上的增量特征选取。为了解决这个问题,提出适用于连续型数据的基于模糊粗糙集的增量属性约简算法。首先提出模糊粗糙基本概念的增量机制,如模糊正域的增量机制。只有部分示例在已有属性约简上的辨识能力不足,即对于模糊正域来说,存在一个关键示例集。增量约简算法基于已有数据上的约简结果,仅需要更新关键示例集中的示例,而非全部的论域。因而该增量算法在动态数据上能快速获得约简的更新。通过数值对比实验可以看出,增量算法比非增量算法在运行时间上有明显的优势。特别是对于高维数据集,增量算法可以大大地节省计算时间。

关 键 词:特征选择  增量学习  模糊粗糙集  依赖度

Dynamic Fuzzy Rough Feature Selection Algorithm
NI Peng,LIU Yangming,ZHAO Suyun,CHEN Hong,LI Cuiping.Dynamic Fuzzy Rough Feature Selection Algorithm[J].Journal of Frontier of Computer Science and Technology,2020,14(2):236-243.
Authors:NI Peng  LIU Yangming  ZHAO Suyun  CHEN Hong  LI Cuiping
Affiliation:(Key Laboratory of Data Engineering and Knowledge Engineering,Ministry of Education,Renmin University of China,Beijing 100872,China;School of Information,Renmin University of China,Beijing 100872,China)
Abstract:Since data update over time and space constantly,many rough set based incremental techniques have been proposed.Whereas there is less work on fuzzy rough set based feature selection(i.e.,attribute reduction)from the dynamic data,especially the continuous dynamic data.In order to address this problem,an incremental attribute reduction algorithm based on fuzzy rough set is proposed for continuous data.First,some incremental mechanisms on fuzzy rough set are proposed,such as the incremental mechanisms of fuzzy positive region.Only some instances have insufficient identification capabilities on existing attribute reduction.That is,for the fuzzy positive region,there exists a key instance set.The incremental reduction algorithm updates the reduction results on the existing data by only considering the instances in the key instance set,but not the entire universe.Therefore,the incremental algorithm can quickly obtain a reduction update on dynamic data.Finally,some numerical experiments demonstrate that the incremental algorithm is effective and efficient compared to non-incremental attribute reduction algorithms.The incremental algorithm can save computing time greatly,especially on the datasets with high dimension.
Keywords:feature selection  incremental learning  fuzzy rough set  dependency function
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号