Rough computational methods for information systems
From MaRDI portal
Publication:1274555
DOI10.1016/S0004-3702(98)00090-3zbMath0909.68047MaRDI QIDQ1274555
Publication date: 12 January 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items
THE ALGORITHM ON KNOWLEDGE REDUCTION IN INCOMPLETE INFORMATION SYSTEMS, Closure via functional dependence simplification, ON DOMINANCE RELATIONS IN DISJUNCTIVE SET-VALUED ORDERED INFORMATION SYSTEMS, Decision-relative discernibility matrices in the sense of entropies, Fuzzy-rough feature selection accelerator, Pessimistic rough set based decisions: a multigranulation fusion strategy, Methods for knowledge reduction in inconsistent ordered information systems, Positive approximation: an accelerator for attribute reduction in rough set theory, Discernibility matrix simplification for constructing attribute reducts, Rough computational methods for information systems, Cost-sensitive approximate attribute reduction with three-way decisions, The relationship between attribute reducts in rough sets and minimal vertex covers of graphs, Inclusion degree: A perspective on measures for rough set data analysis, Generalizations of rough sets via topology, MGRS: a multi-granulation rough set, Set-based granular computing: a lattice model, Updating attribute reduction in incomplete decision systems with the variation of attribute set, Positive macroscopic approximation for fast attribute reduction, Interval ordered information systems, Set-valued ordered information systems, Non-deterministic ideal operators: an adequate tool for formalization in data bases, NEC: a nested equivalence class-based dependency calculation approach for fast feature selection using rough set theory, Research on the Representation Methods for Rough Knowledge, Ideal non-deterministic operators as a formal framework to reduce the key finding problem
Cites Work
