@INPROCEEDINGS { Rsds4179,
author = {Peters, James F. and Skowron, Andrzej and Stepaniuk, Jaroslaw}, 
title = {Nearness in Approximation Spaces}, 
booktitle = {Procedings of the Workshop in Concurrency, Specification and Programming (CS&P'2006)}, 
series =  = {Informatik Berichte}, 
pages = {434--445}, 
publisher = {Humboldt Universitat zu Berlin}, 
address = {Berlin, Germany}, 
year = 2006, 
editor = {Lindemann, Gabriela and Schlingloff, Holger and Burkhard, Hans Dieter and Czaja, Ludwik and Penczek, Wojciech and Salwicki, Andrzej and Skowron, Andrzej and Suraj, Zbigniew}, 
abstract = {The problem considered in this paper is the extension of an approximation space to include a nearness relation. Approximation spaces were introduced by Zdzislaw Pawlak during the early 1980s as frameworks for classifying objects by means of attributes (features). Pawlak introduced approximations as a means of approximating one set of objects with another set of objects using an indiscernibility relation that is based on a comparison between the feature values of objects. Until now, the focus has been on the overlap between sets. It is possible to introduce a nearness relation that can be used to determine the â€śnearnessâ€ť of sets that are possibly disjoint. Several members of a family of nearness relations are introduced in this article. The contribution of this article is the introduction of a nearness relation that makes it possible to extend Pawlakâ€™s model for an approximation space and to consider the extension of generalized approximations spaces.}, 
keywords = {rough sets, approximation, approximation space, classification, feature, nearness relation, neighborhood, proximity space, }, 
}