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

分类算法中基于差别矩阵的属性约简方法
引用本文:何海涛,秦燕芬,曹凤翔.分类算法中基于差别矩阵的属性约简方法[J].东北重型机械学院学报,2011(4):366-369,376.
作者姓名:何海涛  秦燕芬  曹凤翔
作者单位:[1]燕山大学信息科学与工程学院,河北秦皇岛066004 [2]秦皇岛北方破璃集团有限公司,河北秦皇岛066004
基金项目:河北省自然科学基金资助项目(F2010001298)
摘    要:差别矩阵中会出现大量的重复元素占用大量内存,当数据太稠密时,构成的差别矩阵太大不容易操作且计算代价较高。本文提出了一种基于简化差别矩阵的属性约简算法(SDMAR),在属性约简之前,通过计算属性相似度,对属性进行了合并操作,得到简化决策表。根据简化决策表构造差别矩阵,计算差别矩阵中出现次数最多的属性并删除包含该属性的元素,当差别矩阵为空时终止操作,以达到对决策表属性约简的目的。通过算法及实例分析得到属性约简过程的时间复杂度有所减小。

关 键 词:分类  属性约简  差别矩阵

Attribute reduction algorithm based on discernibility matrices in classification
Affiliation:HE Hai-tao,QIN Yan-fen,CHAO Feng-xiang (College of Information Science and Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China;2.Qinhuangdao North Glass Group Co.,Ltd,Qinhuangdao,Hebei 066004,China)
Abstract:Large numbers of duplicate elements contained in discernibility matrix may employ a lot of memory.When the dataset is dense,the time complexity of constructing discernibility matrix is very high.In this paper,an attribute reduction algorithm SDMAR based on simplified discernibility matrix is proposed.Firstly,the attributes are merged by calculating the attributes similarity and the same individuals in universe are deleted before reducing attribute,then a simplified decision table is got.Secondly, simplified discernibility matrix is constructed according to reduction decision table.To achieve the purpose of attribute reduction, the attributes occurred most frequent in discernibility matrix are found and the elements included these attributes are deleted,until discernibility matrix is empty.The analysis of the algorithm and a case shows the time complexity of attribute reduction is low.
Keywords:classification  attribute reduction  discernibility matrices
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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