Abstract
Rules induced from rough sets are described by an approach using possible coverings in an incomplete data set with similarity of values. In a complete data set only one covering is derived, whereas lots of possible coverings are derived in an incomplete data set. This seems to present some difficulties due to computational complexity, but it is not. No difficulty comes from the lattice structure that the family of possible coverings has. Four approximations that rough sets are consisted of are derived by using only two coverings: the minimum and maximum possible ones. Four types of rules can be induced from the approximations. So, we can derive the rules without worrying about computational complexity coming from the number of values with incomplete information.
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.
