Iterative Set Approximations Based on Tolerance Relation

We introduce two covering approximation spaces which utilise a ranking method to reduce the number of base sets used at approximation of a set. The ranking method aggregates all the information embedded in the tolerance relation and selects the most promising representatives. We present the method in the context of its process and describe some interesting features of our approximation pairs.