Relations of reduction between covering generalized rough sets and concept lattices
From MaRDI portal
Publication:528775
DOI10.1016/j.ins.2014.11.053zbMath1360.68803OpenAlexW2085298912MaRDI QIDQ528775
Jinkun Chen, Zhouming Ma, Guoping Lin, Jin Jin Li, Yao-Jin Lin
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.11.053
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (16)
Comparison of reduction in formal decision contexts ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Bireducts with tolerance relations ⋮ Concept reduction of object-induced three-way concept lattices ⋮ Fuzzy \(\beta \)-covering approximation spaces ⋮ Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis ⋮ Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets ⋮ Relationships between generalized rough sets based on covering and reflexive neighborhood system ⋮ A fast attribute reduction method for large formal decision contexts ⋮ Attribute reduction in generalized one-sided formal contexts ⋮ A methodology for analysis of concept lattice reduction ⋮ Maps between covering approximation spaces and the product space of two covering approximation spaces ⋮ Describing hierarchy of concept lattice by using matrix ⋮ The characterizations of upper approximation operators based on coverings ⋮ Characterizing reducts in multi-adjoint concept lattices ⋮ A computational procedure for variable selection preserving different initial conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Theory and applications of granular labelled partitions in multi-scale decision tables
- Multi-adjoint property-oriented and object-oriented concept lattices
- Knowledge reduction in real decision formal contexts
- A novel method for attribute reduction of covering decision systems
- Characterization and reduction of concept lattices through matroid theory
- A heuristic knowledge-reduction method for decision formal contexts
- Approaches to knowledge reduction of covering decision systems based on information theory
- Topological approaches to covering rough sets
- A comparison of two types of rough sets induced by coverings
- Fuzzy preference based rough sets
- Reduction about approximation spaces of covering generalized rough sets
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- MGRS: a multi-granulation rough set
- Multi-adjoint t-concept lattices
- Rule acquisition and complexity reduction in formal decision contexts
- Axiomatic characterizations of dual concept lattices
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Reduction method for concept lattices based on rough set theory and its application
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Set-valued ordered information systems
- Measuring roughness of generalized rough sets induced by a covering
- Dual multi-adjoint concept lattices
- Rough set model based on formal concept analysis
- Vector-based Attribute Reduction Method for Formal Contexts
- Knowledge reduction in formal decision contexts based on an order-preserving mapping
- Rough sets
- Comparing performance of algorithms for generating concept lattices
- Rough Sets and Current Trends in Computing
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Fuzzy sets
This page was built for publication: Relations of reduction between covering generalized rough sets and concept lattices