Ordinal classification with monotonicity constraints by variable consistency bagging

  • Authors:
  • Jerzy Błaszczyński;Roman Słowiński;Jerzy Stefanowski

  • Affiliations:
  • Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland and Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland

  • Venue:
  • RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an ensemble method that solves ordinal classification problem with monotonicity constraints. The classification data is structured using the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA). The method employs a variable consistency bagging scheme to produce bootstrap samples that privilege objects (i.e., classification examples) with relatively high values of consistency measures used in VC-DRSA. In result, one obtains an ensemble of rule classifiers learned on bootstrap samples. Due to diversification of bootstrap samples controlled by consistency measures, the ensemble of classifiers gets more accurate, which has been acknowledged by a computational experiment on benchmark data.