Connections between covering-based rough sets and concept lattices
From MaRDI portal
Publication:473370
DOI10.1016/j.ijar.2014.09.001zbMath1388.68260OpenAlexW2029963295MaRDI QIDQ473370
Guoping Lin, Anhui Tan, Jin Jin Li
Publication date: 24 November 2014
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2014.09.001
formal concept analysisconcept latticeapproximation operatorknowledge reductioncovering-based rough sets
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items
Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets, Comparison of reduction in formal decision contexts, Granular matrix method of attribute reduction in formal contexts, Evidence-theory-based numerical characterization of multigranulation rough sets in incomplete information systems, Reductions of a covering approximation space from algebraic points of view, Dependence space models to construct concept lattices, On some types of covering rough sets from topological points of view, A rough set method for the vertex cover problem in graph theory, Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets, A fast attribute reduction method for large formal decision contexts, Object-oriented interval-set concept lattices, Maps between covering approximation spaces and the product space of two covering approximation spaces
Cites Work
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Knowledge reduction in real decision formal contexts
- Multigranulation rough sets: from partition to covering
- A comparison of two kinds of definitions of rough approximations based on a similarity relation
- A heuristic knowledge-reduction method for decision formal contexts
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- Covering based rough set approximations
- Attribute reduction theory and approach to concept lattice
- Reduction about approximation spaces of covering generalized rough sets
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Generalized probabilistic approximations of incomplete data
- Multigranulation decision-theoretic rough sets
- Rule acquisition and complexity reduction in formal decision contexts
- Membership function based rough set
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- On the rough consistency measures of logic theories and approximate reasoning in rough logic
- Set-based granular computing: a lattice model
- A novel cognitive system model and approach to transformation of information granules
- Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
- 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
- Knowledge reduction in formal decision contexts based on an order-preserving mapping
- Formal Topology and Information Systems
- Lattice Theory for Rough Sets
- Comparing performance of algorithms for generating concept lattices
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Rough Sets and Current Trends in Computing
- Theory and Applications of Relational Structures as Knowledge Instruments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
