Describing rough approximations by indiscernibility relations in information tables with incomplete information
From MaRDI portal
(Redirected from Publication:5117219)
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
- An Approach Based on Rough Sets to Possibilistic Information
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- 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
(19)- Definability in incomplete information tables
- Rough set approach to incomplete information systems
- Distributed approach for computing rough set approximations of big incomplete information systems
- Rules induced from rough sets in information tables with continuous values
- Possible coverings in incomplete information tables with similarity of values
- A rule induction algorithm for incomplete information system
- scientific article; zbMATH DE number 1303635 (Why is no real title available?)
- scientific article; zbMATH DE number 597808 (Why is no real title available?)
- An interval set model for learning rules from incomplete information table
- Rough sets in incomplete information systems with order relations under Lipski's approach
- Transactions on Rough Sets I
- Twofold rough approximations under incomplete information
- Rough Sets and Current Trends in Computing
- Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
- Local and Global Approximations for Incomplete Data
- Local and Global Approximations for Incomplete Data
- Rough sets based on possible indiscernibility relations in incomplete information tables with continuous values
- Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values
- 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)