Graph-based granularity reduction in pessimistic multi-granulation rough set

DOI10.6040/J.ISSN.1671-9352.0.2020.205MaRDI QIDQ4996128zbMATH OpenFDO

Authors Yidong Lin, Wenjuan Zhang, Jinjin Li

Publication date 1 July 2021

Full work available at URL https://doi.org/10.6040/J.ISSN.1671-9352.0.2020.205

zbMATH Keywords

granularity reductiongraph theorymulti-granulation rough setvertex cover

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Granulation reduction of graded multi-granulation rough set based on granulation matrix
• An attribute reduction algorithm based on multi-granularity rough decision
• A rough set method for the vertex cover problem in graph theory
• Knowledge reduction of pessimistic multigranulation rough sets in incomplete information systems
• Granular space reduction to a \(\beta\) multigranulation fuzzy rough set

Cited in

(2)

• A rough set method for the vertex cover problem in graph theory
• Granulation reduction of graded multi-granulation rough set based on granulation matrix

This page was built for publication: Graph-based granularity reduction in pessimistic multi-granulation rough set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996128)