Abstract
The concept hierarchies provide a new way to solve such problems as the data are increasing too fast,there are so many rules,and different decision makers need obtain some rules from different hierarchies.In the context that every condition attribute had a concept hierarchy,the relations of positive regions and rules from different levels were analyzed based on rough set theory.Then,the algorithm of optimal credible rules based on rough sets in concept hierarchies was proposed,which was along with concept hierarchies from top to down.The algorithm improved the existing reduction strategy,realized the reduction and obtained the optimal credible rules by descriptors.Besides,it also considered there was null or not a new object in the positive region,and the effectiveness of extracting rules was improved.Finally,the feasibility of this algorithm was validated by an example.
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.
