Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information
DOI10.1007/978-3-319-40581-0_29zbMATH Open1455.68213OpenAlexW2503984711MaRDI QIDQ5117219FDOQ5117219
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
rough setsincomplete informationrule inductionlower and upper approximationsindiscernibility relation
Cites Work
- Title not available (Why is that?)
- Maximal consistent block technique for rule acquisition in incomplete information systems.
- Rules in incomplete information systems
- On Databases with Incomplete Information
- Transactions on Rough Sets I
- An Approach Based on Rough Sets to Possibilistic Information
- Twofold rough approximations under incomplete information
Cited In (9)
- Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
- Transactions on Rough Sets I
- Rough Sets and Current Trends in Computing
- Title not available (Why is that?)
- 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
- Definability in incomplete information tables
- Twofold rough approximations under incomplete information
- Tolerance Relations and Rough Approximations in Incomplete Contexts
This page was built for publication: Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117219)
