Probabilistic rough set approaches to ordinal classification with monotonicity constraints

Authors:
Jerzy Błaszczyński;Roman Słowiński;Marcin Szeląg
Affiliations:
Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland and Institute for Systems Research, Polish Academy of Sciences, Warsaw, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Venue:
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Year:
2010

Citing 10
Cited 1

Learning and classification of monotonic ordinal concepts

Computational Intelligence
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Separate-and-Conquer Rule Learning

Artificial Intelligence Review
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques
Statistical Comparisons of Classifiers over Multiple Data Sets

The Journal of Machine Learning Research
Machine Learning and Data Mining: Introduction to Principles and Algorithms

Machine Learning and Data Mining: Introduction to Principles and Algorithms
Monotonic Variable Consistency Rough Set Approaches

International Journal of Approximate Reasoning
Sequential covering rule induction algorithm for variable consistency rough set approaches

Information Sciences: an International Journal
On variable consistency dominance-based rough set approaches

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing

Multi-agent based classification using argumentation from experience

PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some probabilistic rough set approaches to ordinal classification with monotonicity constraints, where it is required that the class label of an object does not decrease when evaluation of this object on attributes improves. Probabilistic rough set approaches allow to structure the classification data prior to induction of decision rules. We apply sequential covering to induce rules that satisfy consistency constraints. These rules are then used to make predictions on a new set of objects. After discussing some interesting features of this type of reasoning about ordinal data, we perform an extensive computational experiment to show a practical value of this proposal which is compared to other well known methods.