Find in Library

With advanced technology in medicine and biology, data sets containing information could be huge and complex that sometimes are difficult to handle. Dynamic computing is an efficient approach to solve some problems. Since multigranulation rough sets were proposed, many algorithms have been designed for updating approximations in multigranulation rough sets, but they are not efficient enough in terms of computational time. The purpose of this study is to further reduce the computational time of updating approximations in multigranulation rough sets. First, searching regions in data sets for updating approximations in multigranulation rough sets are shrunk. Second, matrix-based approaches for updating approximations in multigranulation rough set are proposed. The incremental algorithms for updating approximations in multigranulation rough sets are then designed. Finally, the efficiency and validity of the designed algorithms are verified by experiments.