Comparison of the probabilistic approximate classification and the fuzzy set model
Fuzzy Sets and Systems
Advances in the Dempster-Shafer theory of evidence
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Variable Consistency Model of Dominance-Based Rough Sets Approach
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
An Algorithm for Induction of Decision Rules Consistent with the Dominance Principle
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
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
Rule-based estimation of attribute relevance
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
We are considering knowledge discovery from data describing a piece of real or abstract world. The patterns being induced put in evidence some laws hidden in the data. The most natural representation of patterns-laws is by ''if..., then...'' decision rules relating some conditions with some decisions. The same representation of patterns is used in multi-attribute classification, thus the data searched for discovery of these patterns can be seen as classification data. We adopt the classification perspective to present an original methodology of inducing general laws from data and representing them by so-called monotonic decision rules. Monotonicity concerns relationships between values of condition and decision attributes, e.g. the greater the mass (condition attribute), the greater the gravity (decision attribute), which is a specific feature of decision rules discovered from data using the Dominance-based Rough Set Approach (DRSA). While in DRSA one has to suppose a priori the presence or absence of positive or negative monotonicity relationships which hold in the whole evaluation space, in this paper, we show that DRSA can be adapted to discover rules from any kind of input classification data, exhibiting monotonicity relationships which are unknown a priori and hold in some parts of the evaluation space only. This requires a proper non-invasive transformation of the classification data, permitting representation of both positive and negative monotonicity relationships that are to be discovered by the proposed methodology. Reported results of a computational experiment confirm that the proposed methodology leads to decision rules whose predictive ability is similar to the best classification predictors. It has, however, a unique advantage over all competitors because the monotonic decision rules can be read as laws characterizing the analyzed phenomena in terms of easily understandable ''if..., then...'' decision rules, while other predictor models have no such straightforward interpretation.