Rough sets and ordinal reducts

Rough set theory has been successfully applied in selecting attributes to improve the effectiveness in deriving decision trees/rules for decisions and classification problems. When decisions involve ordinal classes, the rough set reduction process should try to preserve the order relation generated by the decision classes. Previous works on rough sets when applied to ordinal decision systems still focus on preserving the information relating to the decision classes and not the underlying order relation. In this paper, we propose a new way of evaluating and finding reducts involving ordinal decision classes which focus on the order generated by the ordinal decision classes.