@INCOLLECTION { Rsds2895,
author = {Krawiec, Krzysztof and Slowinski, Roman and Vanderpooten, Daniel}, 
title = {Learning Decision Rules from Similarity Based Roug h Approximations}, 
booktitle = {Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems}, 
series =  = {Studies in Fuzziness and Soft Computing}, 
pages = {37--54}, 
publisher = {Physica-Verlag}, 
address = {Heidelberg, Germany}, 
year = 1998, 
editor = {Polkowski, Lech and Skowron, Andrzej}, 
isbn = {3-7908-1120-3}, 
abstract = {Decision rules induced from lower approximations of decision classes are certain in the sense of covering the objects which certainly belong to the corresponding decision classes. The definition of rough approximations is originally based on an indiscernibility relation in the set of objects. The indiscernibility relation requiring strict of attribute values for the objects being compared is often restrictive in practical applications. This is why, we are proposing to use a more natural similarity relation to define rough approximation of decision classes. The only requirement imposed on this relation is reflexivity. The similarity relations is being derived from data. Decision rules induced from lower approximations of decision classes based on similarity are not only certain but robust in the sense of covering which belong to the corresponding decision classes and are not similar to objects from outside, The approach is illustrated by a simple example and it is validated on a set benchmark examples.}, 
keywords = {rough sets, similarity relation, decision rules, classification tests, }, 
}