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

水平划分决策表的属性约简算法
引用本文:葛浩,李龙澍,徐怡,杨传健.水平划分决策表的属性约简算法[J].四川大学学报(工程科学版),2014,46(3):89-94.
作者姓名:葛浩  李龙澍  徐怡  杨传健
作者单位:滁州学院机械与电子工程学院,安徽大学 计算机科学与技术学院,安徽大学 计算机科学与技术学院,滁州学院 计算机与信息工程学院
基金项目:国家自然科学基金:No.5130711;安徽省自然科学基金项目(No.1308085QF114);安徽高等学校省级自然科学研究重点项目(No.KJ2013A015, KJ2012A212)
摘    要:差别矩阵属性约简是粗糙集重要约简方法之一,但在处理不一致大数据集时存在不足。为此,提出了决策差别矩阵的概念,并给出基于决策差别矩阵的属性约简定义,同时研究了由该定义获得的约简与正区域约简之间的等价性。为了提高求解效率,给出水平划分决策表的方法,指出将划分的子决策表分配到不同的网络节点上,基于子决策差别矩阵可并行完成核属性和属性约简;并设计了并行约简算法。实例分析和UCI中数据集的实验比较表明所提出的约简算法是正确的、高效的。

关 键 词:粗糙集  决策差别矩阵  核属性  属性约简
收稿时间:2013/10/14 0:00:00
修稿时间:2013/12/18 0:00:00

An Algorithm for Attribute Reduction Based on Horizontally Partitioning Decision Table
Ge Hao,Li Longshu,Xu Yi and Yang Chuanjian.An Algorithm for Attribute Reduction Based on Horizontally Partitioning Decision Table[J].Journal of Sichuan University (Engineering Science Edition),2014,46(3):89-94.
Authors:Ge Hao  Li Longshu  Xu Yi and Yang Chuanjian
Affiliation:Key Lab. of Computation Intelligence and Signal Processing of Education Ministry,Anhui Univ.;School of Mechanical and Electronic Eng.,Chuzhou Univ.;School of Computer Sci. and Technol.,Anhui Univ.;Key Lab. of Computation Intelligence and Signal Processing of Education Ministry,Anhui Univ.;School of Computer Sci. and Technol.,Anhui Univ.;Key Lab. of Computation Intelligence and Signal Processing of Education Ministry,Anhui Univ.;School of Computer Sci. and Technol.,Anhui Univ.;School of Computer and Info. Eng.,Chuzhou Univ.
Abstract:The attribute reduction based on discernibility matrix is one of important research issues in rough set theory, which exist some shortcomings when dealing with inconsistent decision table and big data sets. So, the notion of decision discernibility matrix and definition of attribute reduction based on decision discernibility matrix are present, and it is proved that attribute reduction acquired from the definition is equivalence to attribute reduction based on positive region. For improving efficiency of reduction, this paper proposes the method of horizontally partitioning decision table, and points out that the sub-decision table can be assigned to different network nodes and finish computing core attribute and attribute reduction based on sub-decision discernibility matrix. Moreover, a parallel reduction algorithm is designed. Finally, the example analysis experiment results form datasets of UCI show that the proposed parallel algorithms are efficient and effective.
Keywords:rough set  decision discernibility matrix  core attributes  attribute reduction
本文献已被 CNKI 等数据库收录!
点击此处可从《四川大学学报(工程科学版)》浏览原始摘要信息
点击此处可从《四川大学学报(工程科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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