Abstract
As we all known, dynamic updating of rough approximations and reducts are keys to the applications of the rough set theory in real data sets. In recent years, with respect to different requirements, many approaches have been proposed to study such problems. Nevertheless, few of the them are carried out under multigranulation fuzzy environment. To fill such gap, the updating computations of multigranulation fuzzy rough approximations are explored in this paper. By considering the dynamic increasing of fuzzy granular structures, which are induced by fuzzy relations, naive and fast algorithms are presented, respectively. Moreover, both naive and fast forward greedy algorithms are designed for granular structure selection in dynamic updating environment. Experiments on six data sets from UCI show that fast algorithms are more effective for reducing computational time in comparison with naive algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Machine Learning and Cybernetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
