Approximating sets with equivalence relations

  • Authors:

  • W Marek;H Rasiowa

  • Affiliations:

  • Department of Computer Science, University of Kentucky, Lexington, KY;Institute of Mathematics, Warsaw University, Poland, 00-901 Warszawa

  • Venue:
  • ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

In various considerations of computer science (for instance in image processing and databases) one faces the following situation: Given a set (of points or of documents) one considers a descending sequence of equivalence relations (“approximation spaces of order &Xgr;”). These equivalence relations determine a sequence of closure operations Cli. Given a set X, the approximation sequence of X is simply Cli(X)i&xgr;. We characterize here those sets X which satisfy the condition: X = ∩{Cli(X): i&Xgr;}.