A Framework on Rough Set-Based Partitioning Attribute Selection

Abstract

In this paper, we focus our discussion on the rough set-based partitioning attribute selection. Firstly, we point out that the statement of MMR technique is an extension of Mazlack’s technique is unreasonable. We prove that the mean roughness of MMR technique is only the opposite of that Mazlack’s TR technique. Secondly, we observe that the suggestion of MMR to achieve lower computational complexity using the roughness measurement based on relationship between an attribute a _i ∈ A and the set defined as A – {a _i } instead of calculating the maximum with respect to all {a _j } where a _i  ≠ a _j , 1 ≤ i, j ≤ |A | only can be applied to a special type of information system and we illustrate this with an example. Finally, we propose an alternative technique for selecting partitioning attribute using rough set theory based on dependency of attributes in an information system. We show that the proposed technique is a generalization and has lower computational complexity than that of TR and MMR.