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

基于粗糙集理论的属性约简算法
引用本文:张文东,李明壮,石小艳.基于粗糙集理论的属性约简算法[J].计算机工程与设计,2008,29(22).
作者姓名:张文东  李明壮  石小艳
作者单位:1. 中国石油大学(华东)计算机与通信工程学院,山东,东营,257061
2. 安徽财经大学,信息工程学院,安徽,蚌埠,233041
摘    要:粗糙集理论是一种新的数据挖掘方法,其主要思想是保持分类能力不变的情况下,通过属性约简,达到发掘知识并简化知识的目的.从大量数据发现知识时,属性约简是一个关键问题.在理解和分析基于粗糙集理论的数据挖掘算法基础上,提出了一个基于属性依赖度的属性约简算法.实验结果表明,该算法能更有效地对决策系统进行约简.

关 键 词:粗糙集  数据挖掘  分类  属性依赖度  属性约简

Attribute reduction algorithm based on rough set
ZHANG Wen-dong,LI Ming-zhuang,SHI Xiao-yan.Attribute reduction algorithm based on rough set[J].Computer Engineering and Design,2008,29(22).
Authors:ZHANG Wen-dong  LI Ming-zhuang  SHI Xiao-yan
Affiliation:ZHANG Wen-dong1,LI Ming-zhuang1,SHI Xiao-yan2(1.College of Computer , Communication Engineering,China University of Petroleum(East China),Dongying 257061,China,2.College of Information,Anhui University of Finance , Economics,Bengbu 233041,China)
Abstract:Rough set is a new method of data mining.Its basic theory is though attribute reduction,obtaining knowledge with the same ability of classification.Knowledge reduction is an important issue when dealing with huge amounts of data.By the comprehension and analysis of data mining algorithm based on the rough set theory,one algorithm for attribute reduction based on the degree of depend-ency of attribute is proposed.The experimental results show that the algorithm can effectively reduce the decision system.
Keywords:rough set  data mining  classification  attribute dependencies  attribute reduction  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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