Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information

DOI10.1007/978-3-319-40581-0_29zbMath1455.68213OpenAlexW2503984711MaRDI QIDQ5117219

Hiroshi Sakai, Michinori Nakata

Publication date: 20 August 2020

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40581-0_29

zbMATH Keywords

rough setsincomplete informationrule inductionlower and upper approximationsindiscernibility relation

Mathematics Subject Classification ID

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

Related Items (2)

Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values ⋮ Distributed approach for computing rough set approximations of big incomplete information systems

Cites Work

• Unnamed Item
• Maximal consistent block technique for rule acquisition in incomplete information systems.
• Rules in incomplete information systems
• On Databases with Incomplete Information
• An Approach Based on Rough Sets to Possibilistic Information
• Transactions on Rough Sets I
• Twofold rough approximations under incomplete information

This page was built for publication: Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information