版权说明 操作指南
首页 > 成果 > 详情

Research on heuristic knowledge reduction algorithm for incomplete decision table

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Dai, Xiaopeng;Xiong, Dahong
通讯作者:
Dai, X.(Hndxp_au@126.com)
作者机构:
[Xiong, Dahong; Dai, Xiaopeng] School of Information Science and Technology, Hunan Agricultural University, ChangSha, China
语种:
英文
期刊:
International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings
年:
2010
机构署名:
本校为第一机构
院系归属:
信息科学技术学院
摘要:
The classic theory of Rough sets is based on incomplete information systems. In practicing, decision tables are, however, usually incomplete due to the causes of data outputting or processing. That is to say, there are often default values. In order to deal with incomplete systems, Kryszkiewicz put a Rough sets model on the basis of error tolerance relations. According to this model, constructing discernibility matrixes and discernibility functions is the familiar approach by the current knowledge reduction algorithms. By this means, all reductions can work out. But it has been proved that it ...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com