Abstract
The study of attribute reduction in relation decision systems is an important issue in the field of artificial intelligence. A relation decision system can be constructed when the binary relation is not required to meet reflexivity, symmetry and transitivity. Attribute reduction is to delete irrelevant or redundant attributes according to specific rules. In this paper, according to the existing concept of relative indiscernibility relation set under the equivalence relation, the concept of a binary relation set base is proposed in the relation decision system. Secondly, the concept of the corresponding binary relation set base reduction is proposed, and then the corresponding discernibility matrix that is proved is proposed. Thus, a binary relation base reduction algorithm of the corresponding discernibility matrix is proposed. An example is given to illustrate the effectiveness of the algorithm proposed in this paper.
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.
