A new version of the rule induction system LERS
Fundamenta Informaticae
Rough mereological foundations for design, analysis, synthesis, and control in distributed systems
Information Sciences: an International Journal - From rough sets to soft computing
Rough set approach to incomplete information systems
Information Sciences: an International Journal
Rules in incomplete information systems
Information Sciences: an International Journal
On semantic issues connected with incomplete information databases
ACM Transactions on Database Systems (TODS)
On Databases with Incomplete Information
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Workshop on Rough Set Theory and Granular Computing - Summary
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
An Algorithm for Finding Equivalence Relations from Tables with Non-Deterministic Information
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
On the Unknown Attribute Values in Learning from Examples
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
The Consistent Labeling Problem: Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Improved Axiomatic Definition of Information Granulation
Fundamenta Informaticae
Relational Operations and Uncertainty Measure in Rough Relational Database
Fundamenta Informaticae
Hi-index | 0.00 |
This paper presents a tool for handling equivalence relations in non-deterministic information systems. Some applications of equivalence relations are also shown. In a deterministic information system, it is possible to define an equivalence relation for any set of attributes. However, in a non-deterministic information system, some kinds of equivalence relations which we call possible equivalence relations are definable. This paper proposes two effective procedures producing all possible equivalence relations for any non-deterministic information system and any set of attributes. The details of algorithms, the implementation of algorithms and applications to the rule extraction, etc. are presented.