Accelerating Update of Approximations Under a Dominance Relation

In real-time applications, the information system may often evolves over time. Dynamic information processing is one of main challenges in the research fields related to information processing. Rough sets theory is an excellent information processing tool which has been applied in dynamic information processing researches in recent years. Dominance-based rough sets approach is an outstanding generation of rough sets theory, which can process the ordered information related to the problems of multi-criteria decision analysis and multi-criteria sort. In this article, we investigate some new strategies to unleash the performance of updating approximations in dominance-based rough sets approach further. An original concept of coarse boundary of approximations is given, which can be applied to prune more unnecessary computation in updating approximations further. Then a new incremental approach for updating approximations under a dominance relation is proposed and the corresponding algorithm is designed. A numeric illustration shows the feasibility of the approach. By extensive experimental estimation, the performance of the approach outperforms that of its counterpart on the computational time.