Abstract

A multigranulation rough set (MGRS) model is an expansion of the Pawlak rough set, in which the uncertain concept is characterized by optimistic and pessimistic upper/lower approximate boundaries, respectively. However, there is a lack of approximate descriptions of uncertain concepts by existing information granules in MGRS. The approximation sets of rough sets presented by Zhang provide a way to approximately describe knowledge by using existing information granules. Based on the approximation set theory, this paper proposes the cost-sensitive multigranulation approximation of rough sets, i.e., optimistic approximation and pessimistic approximation. Their related properties were further analyzed. Furthermore, a cost-sensitive selection algorithm to optimize the multigranulation approximation was performed. The experimental results show that when multigranulation approximation sets and upper/lower approximation sets are applied to decision-making environments, multigranulation approximation produces the least misclassification costs on each dataset. In particular, misclassification costs are reduced by more than 50% at each granularity on some datasets.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call