Bankruptcy Prediction with Rough Sets
The bankruptcy prediction problem can be considered an or dinal classification problem. The classical theory of Rough Sets describes objects by discrete attributes, and does not take into account the order- ing of the attributes values. This paper proposes a modification of the Rough Set approach applicable to monotone datasets. We introduce re- spectively the concepts of monotone discernibility matrix and monotone (object) reduct. Furthermore, we use the theory of monotone discrete functions developed earlier by the first author to represent and to com- pute decision rules. In particular we use monotone extensions, decision lists and dualization to compute classification rules that cover the whole input space. The theory is applied to the bankruptcy prediction problem.
|Keywords||attributes selection, bankruptcy prediction, decision rules, ordinal classification, rough sets|
|Publisher||Erasmus Research Institute of Management (ERIM)|
Bioch, J.C., & Popova, V.. (2001). Bankruptcy Prediction with Rough Sets (No. ERS-2001-11-LIS). Erasmus Research Institute of Management (ERIM). Retrieved from http://hdl.handle.net/1765/76