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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Mazlack, L.J., He, A., Zhu, Y., Coppock, S.: A rough set approach in choosing partitioning attributes. In: Proceedings of the ISCA 13th, International Conference, CAINE-2000, pp. 1–6 (2000)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Pawlak, Z.: Rough sets: A theoretical aspect of reasoning about data. Kluwer Academic Publisher, Dordrecht (1991)
Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences. An International Journal 177(1), 3–27 (2007)
Parmar, D., Wu, T., Blackhurst, J.: An algorithm for clustering categorical data using rough set theory. Data and Knowledge Engineering 63, 879–893 (2007)
Yao, Y.Y.: Two views of the theory of rough sets in finite universes. Approximate Reasoning, An International Journal 15(4), 191–317 (1996)
Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. Information Science, An International Journal 109(1-4), 21–47 (1998)
Yao, Y.Y.: Information granulation and rough set approximation. International Journal of Intelligent Systems 16(1), 87–104 (2001)
Roiger, R.J., Geatz, M.W.: Data Mining: A Tutorial-Based Primer. Addison Wesley, Reading (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herawan, T., Deris, M.M. (2009). A Framework on Rough Set-Based Partitioning Attribute Selection. In: Huang, DS., Jo, KH., Lee, HH., Kang, HJ., Bevilacqua, V. (eds) Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence. ICIC 2009. Lecture Notes in Computer Science(), vol 5755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04020-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-04020-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04019-1
Online ISBN: 978-3-642-04020-7
eBook Packages: Computer ScienceComputer Science (R0)