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

加权模糊粗糙约简
引用本文:范星奇,李雪峰,赵素云,陈红,李翠平.加权模糊粗糙约简[J].计算机科学,2018,45(1):133-139.
作者姓名:范星奇  李雪峰  赵素云  陈红  李翠平
作者单位:中国人民大学信息学院 北京100872,中国人民大学环境学院 北京100872,中国人民大学信息学院 北京100872,中国人民大学信息学院 北京100872,中国人民大学信息学院 北京100872
摘    要:基于模糊粗糙集的传统约简算法的时间代价较高,在处理大规模数据时耗时过长,且在许多实际大规模数据集上存在有限时间内无法收敛等问题。因此将权重引入属性约简的定义中,其中属性权重是属性重要度的数值指标。通过构建优化问题来求解属性权重,证明了属性依赖度即是属性权重的最优解。因此,提出了基于属性权重排序的约简算法,从而大大提升了约简的速度,使得约简算法可以应用于大规模数据集,特别是高维数据集中。

关 键 词:模糊粗糙集  属性约简  权重  高维数据
收稿时间:2017/5/8 0:00:00
修稿时间:2017/9/15 0:00:00

Weighted Attribute Reduction Based on Fuzzy Rough Sets
FAN Xing-qi,LI Xue-feng,ZHAO Su-yun,CHEN Hong and LI Cui-ping.Weighted Attribute Reduction Based on Fuzzy Rough Sets[J].Computer Science,2018,45(1):133-139.
Authors:FAN Xing-qi  LI Xue-feng  ZHAO Su-yun  CHEN Hong and LI Cui-ping
Affiliation:College of Information,Renmin University of China,Beijing 100872,China,College of the Environment,Renmin University of China,Beijing 100872,China,College of Information,Renmin University of China,Beijing 100872,China,College of Information,Renmin University of China,Beijing 100872,China and College of Information,Renmin University of China,Beijing 100872,China
Abstract:Now the existing classical reduction algorithms have high time consumption,especially on the large scale datasets.To handle this problem,this paper introduced weights into the concept of attribute reduction,where weight is the measure of attribute significance.By building optimization problem about weights,it is fond that the attribute dependency degree is just the optimal solution of the weights.As a result,this paper proposed a reduction algorithm based on ranked weights,which significantly accelerate attribute reduction.Numerical experiments demonstrate that the proposed algorithm is suitable on large scale datasets,especially on the datasets with high dimension.
Keywords:Fuzzy rough sets  Attribute reduction  Weights  High dimension datasets
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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