DocumentCode :
463396
Title :
Algorithm Studies of Rules Generation in CORS
Author :
Sun, Chengmin ; Liu, Dayou ; Fu, Chunxiao ; Sun, Shuyang
Author_Institution :
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun
Volume :
1
fYear :
2006
fDate :
17-19 July 2006
Firstpage :
572
Lastpage :
577
Abstract :
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
Keywords :
computational complexity; decision making; operations research; rough set theory; containing order rough set; multicriteria decision analysis; rules generation; time complexity; Accuracy; Algorithm design and analysis; Approximation algorithms; Computer science; Educational institutions; Educational technology; Remuneration; Robustness; Sun; Terminology; Algorithm GRs; Algorithm IGRs; Completeness; Criteria; Dominance relation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cognitive Informatics, 2006. ICCI 2006. 5th IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
1-4244-0475-4
Type :
conf
DOI :
10.1109/COGINF.2006.365548
Filename :
4216465
Link To Document :
بازگشت