@INPROCEEDINGS { Rsds4227,
author = {Zhu, William and Wang, Fei-Yue}, 
title = {Axiomatic Systems of Generalized Rough Sets}, 
booktitle = {Rough Sets and Knowledge Technology}, 
conference = {Rough Sets and Knowledge Technology}, 
series =  = {Lecture Notes in Computer Science}, 
volume = 4062, 
pages = {216--221}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2006, 
editor = {Wang, Guoying and Peters, James F. and Skowron, Andrzej and Yao, Yiyu}, 
isbn = {978-3-540-36297-5}, 
abstract = {Rough set theory was proposed by Pawlak to deal with the vagueness and granularity in information systems that are characterized by insufficient, inconsistent, and incomplete data. Its successful applications draw attentions from researchers in areas such as artificial intelligence, computational intelligence, data mining and machine learning. The classical rough set model is based on an equivalence relation on a set, but it is extended to generalized model based on binary relations and coverings. This paper reviews and summarizes the axiomatic systems for classical rough sets, generalized rough sets based on binary relations, and generalized rough sets based on coverings.}, 
keywords = {rough set, covering, granular computing, data mining, }, 
}