Study of algorithm for rule extraction based on rough set theory
XianWen Luo
Abstract
XianWen Luo
Abstract
The main idea of rough set theory is to extract decision rules by attribute reduction and value reduction in the premises of keeping the ability of classification. In this paper, an algorithm on value reduction and for extracting decision rule based on the membership function is proposed. All the decision rules on decision table and the minimal rule set of reduced conditional attribute set without core-valued table would be attained by this algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The main idea of rough set theory is to extract decision rules by attribute reduction and value reduction in the premises of keeping the ability of classification. In this paper, an algorithm on value reduction and for extracting decision rule based on the membership function is proposed. All the decision rules on decision table and the minimal rule set of reduced conditional attribute set without core-valued table would be attained by this algorithm.
Key concepts: Rough set, Decision table, Dominance-based rough set approach, Decision rule, Reduction (mathematics), Data mining, Computer science, Algorithm