Abstract
ABSTRACTThis paper focuses on removing information redundancy from a covering information system. First, we review the common covering reduction methods and discussed their relationship to each other. Second, we consider the explicit and implicit values of compound attributes in order to lay the basis of our work. Then we obtain a network topology of covering. Third, we prove that network topology is a set of bases in a covering information system through an example, in which we obtain all the irreducible elements. Finally, we discuss the network topology-based attribute reduction method, as well as compare it with other methods. Our discussions enrich the existing attribute reduction theories and methods.
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.
