Neighborhood System And Rough Set In Incomplete Information System
Published 2012 · Computer Science
As the first model for Granular Computing, neighborhood system has been widely investigated. In this chapter, the neighborhood system approach is introduced into the incomplete information system. By employing the coverings induced by maximal consistent blocks and support sets of descriptors, two different neighborhood systems can be obtained, respectively. By using the knowledge engineering view in Granular Computing, a new knowledge operation is defined on the neighborhood system, which can help us obtain more knowledge through the known knowledge. Furthermore, by using neighborhood system based rough set model, we can obtain the same lower approximations and smaller upper approximations than the maximal consistent block and descriptor based rough sets.