Approximation Space and LEM2-like Algorithms for Computing Local Coverings

Authors:
Jerzy W. Grzymala-Busse;Wojciech Rząsa
Affiliations:
(Correspd.) Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA. jerzy@ku.edu;Department of Computer Science, University of Rzeszow, 35-310 Rzeszow, Poland. wrzasa@univ.rzeszow.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 8
Cited 0

Tolerance approximation spaces

Fundamenta Informaticae - Special issue: rough sets
A new version of the rule induction system LERS

Fundamenta Informaticae
Relational interpretations of neighborhood operators and rough set approximation operators

Information Sciences—Informatics and Computer Science: An International Journal
A Generalized Definition of Rough Approximations Based on Similarity

IEEE Transactions on Knowledge and Data Engineering
On the Extension of Rough Sets under Incomplete Information

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Rough Sets and Approximation Schemes

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Local and global approximations for incomplete data

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Incomplete data and generalization of indiscernibility relation, definability, and approximations

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss approximation spaces that are useful for studying local lower and upper approximations. Set definability and properties of the approximation space, including best approximations, are considered as well. Finding best approximations is a NP-hard problem. Finally, we present LEM2-like algorithms for determining local lower and upper coverings for a given incomplete data set. Lower and upper approximations, associated with these coverings, are sub-optimal.