180 Abstract— Attribute reduction of an information system is a key problem in rough set theory and its application. It has been proven that finding the minimal reduct of an information system is a NP-hard problem. Main reason of causing NP-hard is combination problem. In this paper, we theoretically study covering rough sets and propose an attribute reduction algorithm of decision systems. It ...

Interval information systems are generalizedmodels of single-valued information systems. By introducing a dominance relation to interval information systems, we propose a ranking approach for all objects based on dominance classes and establish a dominance-based rough set approach, which is mainly based on substitution of the indiscernibility relation by the dominance relation. Furthermore, we ...

In order to handle inconsistencies in ordinal and monotonic information systems, the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) has been proposed and successfully applied in real decision making. However, there exists an error spread of inconsistencies in VC-DRSA. In this paper, we firstly induce a strict-dominance relation into Variable-Precision Rough Sets (VPRS). Two n...

The paper shows the contribution that two different multiple criteria decision aiding (MCDA) methods could provide in the field of strategic decisions and urban and territorial planning. In particular, the analytic network process and the dominance-based rough set approach have been considered and discussed in the work with reference to their role in supporting such decision-making processes, t...

Customer churn means the loss of existing customers to a competitor. Accurately predicting customer behavior may help firms to minimize this loss by proactively building a lasting relationship with their customers. In this paper, the application of the factor analysis and the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) in the customer relationship management (CRM) of the a...

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to cover...