Abstract: Rough set under incomplete information has been extensively studied. Based on valued tolerance relation for incomplete information system, several approaches were presented to dealing with the attribute reductions and rule extraction. We point out some drawbacks in the existing papers for valued tolerance relation based rough approximations and propose a new kind of rough approximation operators which is a generalization of Pawlak approximation operators for complete information system. Some basic properties of the approximation operators are investigated.

Jun-Fang LUO and Ke-Yun QIN, “Rough Approximations for Incomplete Information*” International Journal of Advanced Research in Artificial Intelligence(IJARAI), 3(12), 2014. http://dx.doi.org/10.14569/IJARAI.2014.031202

@article{LUO2014,
title = {Rough Approximations for Incomplete Information*},
journal = {International Journal of Advanced Research in Artificial Intelligence},
doi = {10.14569/IJARAI.2014.031202},
url = {http://dx.doi.org/10.14569/IJARAI.2014.031202},
year = {2014},
publisher = {The Science and Information Organization},
volume = {3},
number = {12},
author = {Jun-Fang LUO and Ke-Yun QIN}
}