The bankruptcy prediction problem can be considered an ordinal classification problem. The classical theory of Rough Sets describesobjects by discrete attributes, and does not take into account the order-ing of the attributes values. This paper proposes a modification of theRough Set approach...

The decision tree algorithm for monotone classification presented in [4, 10] requires strictly monotone data sets. This paper addresses the problem of noise due to violation of the monotonicity constraints and proposes a modification of the algorithm to handle noisy data. It also presents...