A mathematical foundation for improved reduct generation in information systems
From MaRDI portal
Publication:698706
DOI10.1007/S101150050007zbMATH Open1002.68601OpenAlexW2050699786MaRDI QIDQ698706FDOQ698706
Dale E. Nelson, Janusz A. Starzyk, Kirk Sturtz
Publication date: 8 January 2003
Published in: Knowledge and Information Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101150050007
Computing methodologies and applications (68U99) Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Cited In (9)
- A Generic Scheme for Generating Prediction Rules Using Rough Sets
- Shortest-length and coarsest-granularity constructs vs. reducts: an experimental evaluation
- Analysis of alternative objective functions for attribute reduction in complete decision tables
- Attribute reduction: a horizontal data decomposition approach
- Rule acquisition and attribute reduction in real decision formal contexts
- DYNAMIC REDUCTS GENERATION USING CASCADING HASHES
- Attribute reduction based on evidence theory in incomplete decision systems
- Finding rough and fuzzy-rough set reducts with SAT
- On the topological properties of generalized rough sets
This page was built for publication: A mathematical foundation for improved reduct generation in information systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698706)