The classical rough set can not show the fuzziness and the importance of objects in decision procedure because it uses definite form to express each object. In order to solve this problem,this paper firstly introduces...The classical rough set can not show the fuzziness and the importance of objects in decision procedure because it uses definite form to express each object. In order to solve this problem,this paper firstly introduces a special decision table in which each object has a membership degree to show its fuzziness and has been assigned a weight to show its importance in decision procedure. Then,the special decision table is studied and the relevant rough set model is provided. In the meantime,relevant definitions and theorems are proposed. On the above basis,an attribute reduction algorithm is presented. Finally,feasibility of the relevant rough set model and the presented attribute reduction algorithm are verified by an example.展开更多
The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute ...The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.展开更多
In this paper, we study the problem of rule extraction from data sets using the rough set method. For inconsistent rules due to improper selection of split-points during discretization, and/or to lack of information, ...In this paper, we study the problem of rule extraction from data sets using the rough set method. For inconsistent rules due to improper selection of split-points during discretization, and/or to lack of information, we propose two methods to remove their inconsistency based on irregular decision tables. By using these methods, inconsistent rules are eliminated as far as possible, without affecting the remaining consistent rules. Experimental test indicates that use of the new method leads to an improvement in the mean accuracy of the extracted rules.展开更多
基金supported by the Foundation and Frontier Technologies Research Plan Projects of Henan Province of China under Grant No. 102300410266
文摘The classical rough set can not show the fuzziness and the importance of objects in decision procedure because it uses definite form to express each object. In order to solve this problem,this paper firstly introduces a special decision table in which each object has a membership degree to show its fuzziness and has been assigned a weight to show its importance in decision procedure. Then,the special decision table is studied and the relevant rough set model is provided. In the meantime,relevant definitions and theorems are proposed. On the above basis,an attribute reduction algorithm is presented. Finally,feasibility of the relevant rough set model and the presented attribute reduction algorithm are verified by an example.
文摘The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.
基金the Basic Research Foundation of Tsinghua University (No. JC2001029) and the National High-Tech Research and Development Program of China (No. 863-511-930-004)
文摘In this paper, we study the problem of rule extraction from data sets using the rough set method. For inconsistent rules due to improper selection of split-points during discretization, and/or to lack of information, we propose two methods to remove their inconsistency based on irregular decision tables. By using these methods, inconsistent rules are eliminated as far as possible, without affecting the remaining consistent rules. Experimental test indicates that use of the new method leads to an improvement in the mean accuracy of the extracted rules.
