CASIA OpenIR  > 09年以前成果
Reduct and attribute order
Han, SQ; Wang, J
Source PublicationJOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
2004-07-01
Volume19Issue:4Pages:429-449
SubtypeArticle
AbstractBased 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.
KeywordReduct Attribute Order Rough Set
WOS HeadingsScience & Technology ; Technology
Indexed BySCI
Language英语
WOS Research AreaComputer Science
WOS SubjectComputer Science, Hardware & Architecture ; Computer Science, Software Engineering
WOS IDWOS:000222789900001
Citation statistics
Document Type期刊论文
Identifierhttp://ir.ia.ac.cn/handle/173211/9986
Collection09年以前成果
AffiliationChinese Acad Sci, Inst Automat, Lab Complex Syst & Intelligence Sci, Beijing 100080, Peoples R China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Han, SQ]'s Articles
[Wang, J]'s Articles
Baidu academic
Similar articles in Baidu academic
[Han, SQ]'s Articles
[Wang, J]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Han, SQ]'s Articles
[Wang, J]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.