Knowledge Commons of Institute of Automation,CAS
Reduct and attribute order | |
Han, SQ; Wang, J![]() | |
发表期刊 | JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
![]() |
2004-07-01 | |
卷号 | 19期号:4页码:429-449 |
文章类型 | Article |
摘要 | Based on the principle of discernibility matrix, a kind of reduction algorithm with attribute order has been developed and its solution has been proved to be complete for reduct and unique for a given attribute order. Being called the reduct problem, this algorithm can be regarded as a mapping R = Reduct(S) from the attribute order space Theta to the reduct space R for an information system , where U is the universe and C and D are two sets of condition and decision attributes respectively. This paper focuses on the reverse problem of reduct problem S = Order(R), i.e., for a given reduct R of an information system, we determine the solution of S = Order(R) in the space Theta. First, we need to prove that there is at least one attribute order S such that S = Order(R). Then, some decision rules are proposed, which can be used directly to decide whether the pair of attribute orders has the same reduct. The main method is based on the fact that an attribute order can be transformed into another one by moving the attribute for limited times. Thus, the decision of the pair of attribute orders can be altered to the decision of the sequence of neighboring pairs of attribute orders. Therefore, the basic theorem of neighboring pair of attribute orders is first proved, then, the decision theorem of attribute order is proved accordingly by the second attribute. |
关键词 | Reduct Attribute Order Rough Set |
WOS标题词 | Science & Technology ; Technology |
收录类别 | SCI |
语种 | 英语 |
WOS研究方向 | Computer Science |
WOS类目 | Computer Science, Hardware & Architecture ; Computer Science, Software Engineering |
WOS记录号 | WOS:000222789900001 |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.ia.ac.cn/handle/173211/9986 |
专题 | 09年以前成果 |
作者单位 | Chinese Acad Sci, Inst Automat, Lab Complex Syst & Intelligence Sci, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Han, SQ,Wang, J. Reduct and attribute order[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2004,19(4):429-449. |
APA | Han, SQ,&Wang, J.(2004).Reduct and attribute order.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,19(4),429-449. |
MLA | Han, SQ,et al."Reduct and attribute order".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 19.4(2004):429-449. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Han, SQ]的文章 |
[Wang, J]的文章 |
百度学术 |
百度学术中相似的文章 |
[Han, SQ]的文章 |
[Wang, J]的文章 |
必应学术 |
必应学术中相似的文章 |
[Han, SQ]的文章 |
[Wang, J]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论