Abstract
As an effective tool for data representation and processing, granular computing has been incorporated into formal decision contexts for finding granular reducts to achieve the task of mining granular rules. However, the classification performance of granular rules has not been evaluated, and this type of method is not suitable for dynamic data. To solve this problem, the current study updates granular reducts and evaluates the obtained granular rules in terms of classification performance. Concretely, we first give a theoretical analysis of updating granular reducts and granular rules and then present a novel dynamic rule-based classification model (DRCM) based on the updating mechanism. Finally, we discuss the feasibility of the proposed model and compare it with several popular classification algorithms. The conducted experiments demonstrate that the granular reducts can improve the classification ability to a certain extent and that DRCM can achieve better classification performance on some consistent datasets.
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 callDisclaimer: 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.
