A framework on rough set-based partitioning attribute selectiom

Herawan, Tutut and Mat Deris, Mustafa (2009) A framework on rough set-based partitioning attribute selectiom. In: ICIC'09: Proceedings of the Intelligent Computing 5th international conference on Emerging Intelligent Computing Technology and Applications, 16-19 September 2009, Ulsan, Korea .

Full text not available from this repository.

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 ai ∈ A and the set defined as A-{ai} instead of calculating the maximum with respect to all {aj} where ai ≠ aj, 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.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:dependency of attributes; rough set theory
Subjects:Q Science > QA Mathematics
Q Science > QA Mathematics > QA63 Problem solving
Divisions:Faculty of Computer Science and Information Technology > Department of Software Engineering
ID Code:3596
Deposited By:Normajihan Abd. Rahman
Deposited On:15 Nov 2015 16:14
Last Modified:15 Nov 2015 16:14

Repository Staff Only: item control page