Abstract
In this paper we consider a generalization of the indiscernibility relation, i.e., a relation R that is not necessarily reflexive, symmetric, or transitive. There exist 36 basic definitions of lower and upper approximations based on such relation R. Additionally, there are six probabilistic approximations, generalizations of 12 corresponding lower and upper approximations. How to convert remaining 24 lower and upper approximations to 12 respective probabilistic approximations is an open problem. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Clark, P. G., Grzymała-Busse, J. W., & Rza̧sa, W. (2013). Generalizations of approximations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8171 LNAI, pp. 41–52). https://doi.org/10.1007/978-3-642-41299-8_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
