Ordinal classification with monotonicity constraints by variable consistency bagging

11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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 earned 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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Błaszczyński, J., Słowiński, R., & Stefanowski, J. (2010). Ordinal classification with monotonicity constraints by variable consistency bagging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6086 LNAI, pp. 392–401). https://doi.org/10.1007/978-3-642-13529-3_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free