Academic Journal

Approximation Space and LEM2-like Algorithms for Computing Local Coverings.

Bibliographic Details
Title: Approximation Space and LEM2-like Algorithms for Computing Local Coverings.
Authors: Grzymala-Busse, Jerzy W.1 jerzy@ku.edu, Rząsa, Wojciech2 wrzasa@univ.rzeszow.pl
Superior Title: Fundamenta Informaticae. 2008, Vol. 85 Issue 1-4, p205-217. 13p. 1 Chart.
Subject Terms: *APPROXIMATION theory, *FUNCTIONAL analysis, *MATHEMATICAL functions, *ALGORITHMS, *ALGEBRA
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. [ABSTRACT FROM AUTHOR]
Copyright of Fundamenta Informaticae is the property of IOS Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Academic Search Premier
Description
Description not available.