Lower approximation reduction based on discernibility information tree in inconsistent ordered decision information systems (Q2337856)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower approximation reduction based on discernibility information tree in inconsistent ordered decision information systems
scientific article

    Statements

    Lower approximation reduction based on discernibility information tree in inconsistent ordered decision information systems (English)
    0 references
    0 references
    0 references
    20 November 2019
    0 references
    Summary: Attribute reduction is an important topic in the research of rough set theory, and it has been widely used in many aspects. Reduction based on an identifiable matrix is a common method, but a lot of space is occupied by repetitive and redundant identifiable attribute sets. Therefore, a new method for attribute reduction is proposed, which compresses and stores the identifiable attribute set by a discernibility information tree. In this paper, the discernibility information tree based on a lower approximation identifiable matrix is constructed in an inconsistent decision information system under dominance relations. Then, combining the lower approximation function with the discernibility information tree, a complete algorithm of lower approximation reduction based on the discernibility information tree is established. Finally, the rationality and correctness of this method are verified by an example.
    0 references
    discernibility information tree
    0 references
    identifiable matrix
    0 references
    inconsistent ordered decision information system
    0 references
    lower approximation reduction
    0 references

    Identifiers