Actionable Strategies in Three-Way Decisions with Rough Sets

Rough set theory uses three pair-wise disjoint regions to approximate a concept. This paper adopts actionable strategies in three-way decision with rough sets. We suggest actionable rules for transferring objects from one region to another and propose a model of optimal actions based on cost-benefit analysis. Actionable strategies allow us to transfer objects from less favourable regions to a favourable region, so that we can reduce the boundary region and the negative region. We design and analyze an algorithm for searching for an optimal solution. The experimental results on a real dataset show that the algorithm has promising outcomes and objects can be effectively moved between regions.