Approaches to knowledge reduction of covering decision systems based on information theory
From MaRDI portal
Publication:833742
DOI10.1016/j.ins.2008.12.025zbMath1179.68193MaRDI QIDQ833742
Publication date: 14 August 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2008.12.025
conditional entropy; information entropy; attribute reduction; covering decision systems; limitary conditional entropy; limitary entropy
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A17: Measures of information, entropy
Related Items
Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets, On lower and upper intension order relations by different cover concepts, The reduction and fusion of fuzzy covering systems based on the evidence theory, Covering cycle matroid, Intuitionistic fuzzy multigranulation rough sets, Quick general reduction algorithms for inconsistent decision tables, Relations of reduction between covering generalized rough sets and concept lattices, Covering based rough set approximations, The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models, Hierarchical structures and uncertainty measures for intuitionistic fuzzy approximation space, Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets, On measurements of covering rough sets based on granules and evidence theory, Fuzzy \(\beta \)-covering approximation spaces, A unified incremental reduction with the variations of the object for decision tables, Four matroidal structures of covering and their relationships with rough sets, Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets, Improved general attribute reduction algorithms, A Comparison of Two Types of Covering-Based Rough Sets Through the Complement of Coverings, The Lower Approximation Number in Covering-Based Rough Set
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rudiments of rough sets
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Analysis on attribute reduction strategies of rough set
- Extensions and intensions in the rough set theory
- Constructive and algebraic methods of the theory of rough sets
- Rough set analysis of a general type of fuzzy data using transitive aggregations of fuzzy similarity relations.
- Reduction and axiomization of covering generalized rough sets.
- Approaches to knowledge reduction based on variable precision rough set model.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Rough set approach to incomplete information systems
- Rules in incomplete information systems
- Knowledge reduction based on the equivalence relations defined on attribute set and its power set
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- Rough sets
- Rough set theory applied to (fuzzy) ideal theory
