Algorithm Studies of Rules Generation in CORS
In Containing Order Rough Set Methodology (CORS), ordered attribute criterion is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significant rules utilizing dominance relations. In this paper, some terminologies and properties on rules or rules set, such as robust, minimal, complete are discussed, the state of art in algorithms on rules generation are analyzed, and algorithms GRs and IGRs are proposed. We compare these two algorithms by experiments in time complexity, rules count and accuracy. We find that GRs can generate all minimal rules, but time complexity is high and IGRs efficiency is better, but quality of rules are inferior to that of GRs. We also discuss the completeness of rules set and present a viewpoint that there are three hierarchies for completeness. In accuracy calculation, three formulas for accuracy calculation and two approaches for experimental test are given.
Criteria Dominance relation Algorithm GRs Algorithm IGRs Completeness
Chengmin Sun Dayou Liu Chunxiao Fu Shuyang sun
College of Computer Science and Technology, Jilin University, Changchun 130012, China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin Uni
国际会议
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
北京
英文
572-577
2006-07-17（万方平台首次上网日期，不代表论文的发表时间）