Abstract
Rough set based rule induction approaches have been studied intensively during past few years. However, classical rough set model cannot deal with incomplete data sets. There are two main categories dealing with this problem: the preprocessing methods and the extensions of rough set model. This paper focuses on the comparison of three strategies for dealing with incomplete data containing three preprocessing methods and one extended discernibility matrix method. These three methods only different when building the discernibility matrix, and they have the same rule induction method. The result shows that some preprocessing methods are stable and relatively effective, while the extended discernibility matrix method is not very effective in dealing with incomplete data.
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 Advancements in Computing Technology
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.
