Label-based Approach for Dynamic Updating Approximations in Incomplete Fuzzy Probabilistic Rough Sets over Two Universes

When the missing values are obtained in incomplete fuzzy probabilistic rough sets over two universes,the time efficiency of the traditional static algorithm for updating approximations in incomplete fuzzy probabilistic rough sets over two universes is too low.To solve this problem,a label-based appr...

Full description

Bibliographic Details
Main Author: XUE Zhan-ao, HOU Hao-dong, SUN Bing-xin, YAO Shou-qian
Format: Article
Language:zho
Published: Editorial office of Computer Science 2022-03-01
Series:Jisuanji kexue
Subjects:
Online Access:https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-3-255.pdf
Description
Summary:When the missing values are obtained in incomplete fuzzy probabilistic rough sets over two universes,the time efficiency of the traditional static algorithm for updating approximations in incomplete fuzzy probabilistic rough sets over two universes is too low.To solve this problem,a label-based approach for dynamic updating approximations in incomplete fuzzy probabilistic rough sets over two universes isstudied.Firstly,some definitions of incomplete fuzzy probabilistic rough over two universes are given,then based on the matrix method,a label-based model of incomplete fuzzy probabilistic rough sets over two universes is proposed,and the related theorems are proved.After that,a label-based method for calculating approximations in incomplete fuzzy probabilistic rough sets over two universes is proposed and analyzed.Then,when the missing values are obtained in incomplete fuzzy probabilistic rough sets over two universes,the theorem for dynamic updating its approximations is proved,and a label-based algorithm for dynamic updating approximations in incomplete fuzzy probabilistic rough sets over two universes is designed and analyzed.Finally,the simulation experiments are conducted on six datasets from UCI and three man-made datasets.The experimental results show that the proposed dynamic updating algorithm can improve the time efficiency of updating approximations.Then an example shows that the dynamic algorithm does not affect the correctness of the results when updating approximations,which proves the validity of the proposed dynamic updating algorithm.
ISSN:1002-137X