GRS: A Generalized Rough Sets Model
Rough sets extends classical set theory by incorporating the set model into the notion of classification in the form of an indiscernibility relation. Rough sets serves as a tool for data analysis and knowledge discovery from databases. A generalized rough sets model, based on the concept of the VPRS-model, is proposed in this paper. Our approach modifies the traditional rough sets model and is aimed at handling uncertain objects by considering the importance of each object while reducing the influence of noise in modelling the classification process.
KeywordsEquivalence Class Decision Attribute Negative Class Positive Class Classification Error Rate
Unable to display preview. Download preview PDF.
- 1.Fayyad U, Piatetsky-Shapiro G, Smyth P and Uthurusamy R. (1996) Advances in Knowledge Discovery and Data Mining, AAAI Press/MIT PressGoogle Scholar
- 2.Hu, X. (1995) Knowledge Discovery in Databases: An Attribute-Oriented Rough Set Approach, Ph.D thesis, University of Regina, CanadaGoogle Scholar
- 3.Hu, X. and Cercone, N. (1996) Mining Knowledge Rules from Databases: An Rough Set Approach, in Proc. of the 12th International Conf. on Data EngineeringGoogle Scholar
- 4.Hu, X. and Cercone, N. (1999) Data Mining via Generalization, Discretization and Rough Set Feature Selection, Knowledge and Information System: An International Journal, 1 (1), 1999Google Scholar
- 5.Katzberg, J.D. and Ziarko, W. (1993) Variable Precision Rough Sets with Asymmetric Bounds, Proc. Intl. Workshop on Rough Sets and Knowledge Discovery, 163–190.Google Scholar
- 6.Lin, T.Y and Cercone, N. (1997) Applications of Rough Sets Theory and Data Mining, Kluwer Academic PublishersGoogle Scholar
- 9.Simoudis, E. Han, J. and Fayyad U. (1996) Proc. of the Second International Conf on Knowledge Discovery & Data MiningGoogle Scholar