On Irreducible Descriptive Sets of Attributes for Information Systems
From MaRDI portal
Recommendations
- Irreducible descriptive sets of attributes for information systems
- scientific article; zbMATH DE number 23766
- Some topological properties of information systems
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Maximal consistent extensions of information systems relative to their theories
Cites work
- Association Reducts: A Framework for Mining Multi-attribute Dependencies
- scientific article; zbMATH DE number 994052 (Why is no real title available?)
- scientific article; zbMATH DE number 994064 (Why is no real title available?)
- scientific article; zbMATH DE number 3870651 (Why is no real title available?)
- scientific article; zbMATH DE number 3932435 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 92603 (Why is no real title available?)
- scientific article; zbMATH DE number 1995180 (Why is no real title available?)
- scientific article; zbMATH DE number 2064228 (Why is no real title available?)
- scientific article; zbMATH DE number 2064470 (Why is no real title available?)
- scientific article; zbMATH DE number 1927350 (Why is no real title available?)
- scientific article; zbMATH DE number 1931887 (Why is no real title available?)
- Information systems theoretical foundations
- Inhibitory rules in data analysis. A rough set approach
- Maximal consistent extensions of information systems relative to their theories
- On Testing Membership to Maximal Consistent Extensions of Information Systems
- Reconstruction of concurrent system models described by decomposed data tables
- Rough sets and concurrency
- Rudiments of rough sets
Cited in
(3)
This page was built for publication: On Irreducible Descriptive Sets of Attributes for Information Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541042)