The multigranulation reduction of generalized neighborhood information systems based on discernibility
摘要
Knowledge reduction of information systems based on rough sets is one of the important applications of granular computing. With the expansion of the application scope of rough sets, knowledge reduction by multigranulation rough sets has received more attention. The multigranulation reduction of generalized neighborhood information systems by discernibility technique is explored in this paper. First, the notion of generalized neighborhood information system is introduced, and the multigranulation rough sets in generalized neighborhood information systems are discussed. Then, knowledge reduction of generalized neighborhood information systems based on multigranulation rough sets is discussed, and discernibility matrices and discernibility functions are constructed to characterize generalized neighborhood pessimistic reduction of generalized neighborhood information systems. Third, the multigranulation pessimistic and optimistic approximations in multigranulation spaces, incomplete information systems, neighborhood information systems and covering information systems are changed into the multigranulation pessimistic and optimistic approximations in generalized neighborhood information systems respectively. Moreover, the multigranulation reductions of multigranulation spaces, incomplete information systems and neighborhood information systems are characterized by the discernibility matrices and discernibility functions based on the reduction theory of generalized neighborhood information systems. Then, the multigranulation reduction of generalized neighborhood information systems by discernibility tools provide a theoretical foundation for the multigranulation reduction of information systems by discernibility.