Abstract
A new concept of Reduct computation is proposed. This set is referred as NewReduct. It is discovered by defining the Indiscernibility matrix modulo (iDMM D) and Indiscernibility function modulo(iDFM D). Reduct is known as interesting and important set of attributes that able to represent the IS, in adverse the NewReduct is set of superfluous, redundant and non-interesting attributes. The computation of attributes defines sets of dispensable attributes and the partitioning of the objects based on indiscernibility relations shaped the information of a new knowledge. It is assumed that the sets of NewReduct attributes are able to uncover hidden knowledge that lies under a hidden pattern. One important knowledge that may be discovered from the IS or DS is the outliers knowledge.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Pawlak, Z.: Rough Sets. Int. Journal of Computer and Information Sciences 11(5), 341–356 (1982)
Mollestad, T.: A Rough Set Aproach to Data Mining: Extracting a Logic of Default Rules from Data, The Norwegian University of Science and Technology (1997)
Mollestad, T., Komorowski, J.: A Rough Set Framework of Prepositional for Mining Default Rules. Springer, Singapore (1998)
Bakar, A.A., Sulaiman, M.N., Othman, M., Selamat, M.H.: IP Algorithms in Compact Rough Classification Modeling. Intelligent Data Analysis 5(5), 419–429 (2001)
Polkowski, L.: Advances in Soft Computing, Rough Sets Mathematical Foundations. Springer, Heidelberg (2002)
Pawlak, Z., Grzymala-Busse, J., Slowinski, R., Ziarko, W.: Rough Sets. Communication of the ACM [Electronic Version] 38 (1995)
Polkowski, L.: Advances in Soft Computing, Rough Sets Mathematical Foundations. Springer, Heidelberg (2002)
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
Shaari, F., Abu Bakar, A., Hamdan, A.R. (2009). On New Concept in Computation of Reduct in Rough Sets Theory. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-02962-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02961-5
Online ISBN: 978-3-642-02962-2
eBook Packages: Computer ScienceComputer Science (R0)