Describing rough approximations by indiscernibility relations in information tables with incomplete information
DOI10.1007/978-3-319-40581-0_29zbMATH Open1455.68213OpenAlexW2503984711MaRDI QIDQ5117219FDOQ5117219
Authors: Michinori Nakata, Hiroshi Sakai 
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
Recommendations
- Rough sets in incomplete information systems with order relations under Lipski's approach
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Twofold rough approximations under incomplete information
- Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values
- scientific article; zbMATH DE number 1303635
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 (13)
- An interval set model for learning rules from incomplete information table
- Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
- Transactions on Rough Sets I
- Local and Global Approximations for Incomplete Data
- 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
- Local and Global Approximations for Incomplete Data
- Twofold rough approximations under incomplete information
- Tolerance Relations and Rough Approximations in Incomplete Contexts
- A rule induction algorithm for incomplete information system
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)
