Describing rough approximations by indiscernibility relations in information tables with incomplete information

DOI10.1007/978-3-319-40581-0_29MaRDI QIDQ5117219zbMATHOpenAlexFDO

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

zbMATH Keywords

rough setsincomplete informationrule inductionlower and upper approximationsindiscernibility relation

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• An Approach Based on Rough Sets to Possibilistic Information
• Maximal consistent block technique for rule acquisition in incomplete information systems.
• On Databases with Incomplete Information
• Rules in incomplete information systems
• Transactions on Rough Sets I
• Twofold rough approximations under incomplete information

Cited in

(17)

• Possible coverings in incomplete information tables with similarity of values
• A rule induction algorithm for incomplete information system
• scientific article; zbMATH DE number 597808 (Why is no real title available?)
• Distributed approach for computing rough set approximations of big incomplete information systems
• Local and Global Approximations for Incomplete Data
• An interval set model for learning rules from incomplete information table
• Transactions on Rough Sets I
• Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
• Rough sets in incomplete information systems with order relations under Lipski's approach
• Local and Global Approximations for Incomplete Data
• Definability in incomplete information tables
• Rules induced from rough sets in information tables with continuous values
• Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values
• Rough sets based on possible indiscernibility relations in incomplete information tables with continuous values
• Tolerance Relations and Rough Approximations in Incomplete Contexts
• Rough Sets and Current Trends in Computing
• Twofold rough approximations under incomplete information

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)