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

基于粗糙集理论不完备信息系统的数据挖掘
引用本文:胡旺,冯伟森,李志蜀,韦力凡.基于粗糙集理论不完备信息系统的数据挖掘[J].四川大学学报(自然科学版),2004,41(4):744-748.
作者姓名:胡旺  冯伟森  李志蜀  韦力凡
作者单位:四川大学计算机学院,成都,610065
摘    要:提出了一种基于推广的粗糙集理论直接在不完备信息系统上进行数据挖掘的方法,并给出了该方法的算法和实例.该方法利用粗糙集理论直接对不完备信息系统进行知识约简,然后根据获得的约简集建立知识层次树,利用规则的支持度阂值s0和置信度阈值c0从知识层次树的压缩搜索空间中提取不完备系统的规则集,该方法保持了原始数据和数据挖掘所获得的知识的真实性,另外,还提出了知识规则的上、下支持度,上、下置信度,规则粗糙度等概念,以便指导用户更好地利用数据挖掘所获得的知识.

关 键 词:不完备信息系统  粗糙集  数据挖掘  规则粗糙度
文章编号:0490-6756(2004)04-0744-05

A Data Mining Method Based on Rough Sets Theory for Incomplete Information System
HU Wang,FENG Wei-sen,LI Zhi-shu,WEI Li-fan.A Data Mining Method Based on Rough Sets Theory for Incomplete Information System[J].Journal of Sichuan University (Natural Science Edition),2004,41(4):744-748.
Authors:HU Wang  FENG Wei-sen  LI Zhi-shu  WEI Li-fan
Abstract:A data mining method based on rough sets theory for incomplete information system is proposed. An algorithm and an instance for this method are given here,also. This method employs rough sets theory by which incomplete information system is reduced. Layered knowledge trees are constructed with sets that are gained by reducing incomplete information system. With thresholds of confidence,c_0,and support,s_0,rule sets of incomplete system are abstracted from the compacted special of the trees. This method keeps the truth of the raw data and the knowledge gained by mining data. Moreover,concepts,such as upper support,lower support,upper confidence,lower confidence,roughness of rules,which can guide users to make good use of knowledge mined from data,are proposed,also.
Keywords:incompleteness information system  rough sets  data mining  roughness of rule
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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