Rough set-based decision rules extraction
Tian Hong
Abstract
Tian Hong
Abstract
Rough set-based data analysis starts from a data table, called an information system. The attribute of information system is usually divided into two parts, condition attributes and decision. Such information system is called decision table. In every decision table a set of decision rules, called a decision algorithm, can be associated. It is shown that every decision algorithm reveals some well-known probabilistic properties, and we compare it with Bayes’theorem.
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.
Rough set-based data analysis starts from a data table, called an information system. The attribute of information system is usually divided into two parts, condition attributes and decision. Such information system is called decision table. In every decision table a set of decision rules, called a decision algorithm, can be associated. It is shown that every decision algorithm reveals some well-known probabilistic properties, and we compare it with Bayes’theorem.
Key concepts: Decision table, Rough set, Dominance-based rough set approach, Decision rule, Computer science, Data mining, Decision system, Influence diagram