Rough sets and infomorphisms: towards approximation of relations in distributed environments

Authors:
Andrzej Skowron;Jarosław Stepaniuk;James F. Peters
Affiliations:
Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland;Department of Computer Science, Bialystok University of Technology, Wiejska 45A, 15-351 Bialystok, Poland;Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 5V6, Canada
Venue:
Fundamenta Informaticae - Concurrency specification and programming
Year:
2002

Citing 11
Cited 14

Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Information flow: the logic of distributed systems

Information flow: the logic of distributed systems
Readings in agents

Readings in agents
Rough mereological foundations for design, analysis, synthesis, and control in distributed systems

Information Sciences: an International Journal - From rough sets to soft computing
Types as processes, via chu spaces

Theoretical Computer Science
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems

Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough-Fuzzy Hybridization: A New Trend in Decision Making

Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Neuro-Computing: Techniques for Computing with Words

Rough-Neuro-Computing: Techniques for Computing with Words
Towards an ontology of approximate reason

Fundamenta Informaticae
Computing with Words in Information/Intelligent Systems 2: Applications

Computing with Words in Information/Intelligent Systems 2: Applications

Complex Patterns

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Modelling Complex Patterns by Information Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Calculi of Approximation Spaces

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
On Irreducible Descriptive Sets of Attributes for Information Systems

RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Rough sets: trends and challenges

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
A categorical approach to mereology and its application to modelling software components

Transactions on rough sets VIII
Construction of concept granule based on rough set and representation of knowledge-based complex system

Knowledge-Based Systems
Modeling rough granular computing based on approximation spaces

Information Sciences: an International Journal
Irreducible descriptive sets of attributes for information systems

Transactions on Rough Sets XI
Ontological framework for approximation

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Rough validity, confidence, and coverage of rules in approximation spaces

Transactions on Rough Sets III
Rough ethology: towards a biologically-inspired study of collective behavior in intelligent systems with approximation spaces

Transactions on Rough Sets III
Extended representation of the conceptual element in temporal context and the diachronism of the knowledge system

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the relationships between information systems and classifications as well as between infomorphisms and definability of relations (between whole objects and their parts) in information systems. Infomorphisms between information systems (classifications) IS1 and IS2 make it possible to define some formulas over IS2 by means of formulas over IS1. The remaining formulas over IS2 can be approximatively defined by means of formulas over IS1. The approximation operations are defined using the rough set approach. We present definitions and examples of such approximations.