中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Quick Attribute Reduction Based on Approximation Dependency Degree

文献类型:期刊论文

作者Min Li; ShaoBo Deng; Shengzhong Feng; Jianping Fan
刊名JOURNAL OF COMPUTERS
出版日期2013
英文摘要Attribute reduction is one of the core research content of Rough sets theory. Many existing algorithms mainly are aimed at the reduction of consistency decision table, and very little work has been done for attribute reduction aimed at inconsistency decision table. In fact, the methods finding Pawlak reduct from consistent decision table are not suitable for inconsistency decision table. In this paper, we introduce the approximation dependency reduction modal and present the Quick Attribution Reduction based on Approximation Dependency Degree (Quick-ARADD), which can retain the original boundary region and the original positive region unchanged, and keep the approximation accuracy unchanged for all decision equivalence classes (the partition of universe on decision attributes) of a decision table. Theoretical analysis and experimental results show that the Quick-ARADD algorithm is effective and feasible.
收录类别EI
原文出处http://69.195.124.86/~academz3/ojs/index.php/jcp/article/view/jcp0804920928
语种英语
源URL[http://ir.siat.ac.cn:8080/handle/172644/5054]  
专题深圳先进技术研究院_数字所
作者单位JOURNAL OF COMPUTERS
推荐引用方式
GB/T 7714
Min Li,ShaoBo Deng,Shengzhong Feng,et al. Quick Attribute Reduction Based on Approximation Dependency Degree[J]. JOURNAL OF COMPUTERS,2013.
APA Min Li,ShaoBo Deng,Shengzhong Feng,&Jianping Fan.(2013).Quick Attribute Reduction Based on Approximation Dependency Degree.JOURNAL OF COMPUTERS.
MLA Min Li,et al."Quick Attribute Reduction Based on Approximation Dependency Degree".JOURNAL OF COMPUTERS (2013).

入库方式: OAI收割

来源:深圳先进技术研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。