Relational Data and Rough Sets

  • Authors:
  • Jaroslaw Stepaniuk

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

  • Venue:
  • Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.