Abstract
In the classic rough set theory [1], two important concepts (reduct of information system and relative reduct of decision table) are defined. They play important roles in the KDD system based on rough sets, and can be used to remove the irrelevant or redundant attributes from practical database to improve the efficiency of rule extraction and the performance of the rules mined. Many researchers have provided some reduct-computing algorithms. But most of them are designed for static database; hence they don’t have the incremental learning capability. The paper first proposes the idea of discernibility system and gives out its formal definition, then presents the concept of reduct in discernibility system, which can be viewed as a generalization of the relative reduct of decision table and the reduct of information system. At last, based on the concept of discernibility system, an incremental algorithm, ASRAI, for computing relative reduct of decision table is presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pawlak Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, 1991
Fayyad U M, Piatetsky-Shapiro G, Smyth P.: From data mining to knowledge discovery: an overview. In: Fayyad U M, Piatetsky-Shapiro G, Smyth P, Uthurusamy R ed. Advances in Knowledge Discovery and Data Mining. Menlo Park, California: AAAI Press / The MIT Press, 1996, 1–35
Skowron A, Stepaniuk J.: Generalized approximation spaces. In: Lin T Y ed. Conference Proceedings of the Third International Workshop on Rough Sets and Soft Computing (RSSC’94). San Jose, Caifornia, USA, 1994, 156–163
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zongtian, L., Zhipeng, X. (1999). Discernibility System in Rough Sets. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-48912-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65866-5
Online ISBN: 978-3-540-48912-2
eBook Packages: Springer Book Archive