Relational Data and Rough Sets

Issue title: Special Issue on Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Stepaniuk, Jaroslaw

Affiliations: Department of Computer Science Bialystok University of Technology Wiejska 45A, 15-351 Bialystok, Poland. E-mail: jstepan@ii.pb.bialystok.pl

Abstract: In this paper, we show that approximation spaces are basic structures for knowledge discovery from multi-relational data. The utility of approximation spaces as fundamental objects constructed for concept approximation is emphasized. Examples of basic concepts are given throughout this paper to illustrate how approximation spaces can be beneficially used in many settings.

Keywords: rough sets, approximation spaces, multi-relational data mining

Journal: Fundamenta Informaticae, vol. 79, no. 3-4, pp. 525-539, 2007