Connections between covering-based rough sets and concept lattices
From MaRDI portal
Publication:473370
DOI10.1016/J.IJAR.2014.09.001zbMATH Open1388.68260OpenAlexW2029963295MaRDI QIDQ473370FDOQ473370
Guoping Lin, Jinjin Li, Anhui Tan
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
Recommendations
- Relations of reduction between covering generalized rough sets and concept lattices
- Relationship among basic concepts in covering-based rough sets
- scientific article; zbMATH DE number 754421
- Relationships between covering-based rough sets and relation-based rough sets
- Concept lattice: a rough set approach
- Covering based rough set approximations
concept latticeformal concept analysisapproximation operatorknowledge reductioncovering-based rough sets
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing performance of algorithms for generating concept lattices
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- Title not available (Why is that?)
- Rough Sets and Current Trends in Computing
- Lattice Theory for Rough Sets
- Relational interpretations of neighborhood operators and rough set approximation operators
- Multigranulation decision-theoretic rough sets
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Title not available (Why is that?)
- Covering based rough set approximations
- Multigranulation rough sets: from partition to covering
- Title not available (Why is that?)
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- Rule acquisition and complexity reduction in formal decision contexts
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Knowledge reduction in formal decision contexts based on an order-preserving mapping
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Knowledge reduction in real decision formal contexts
- A heuristic knowledge-reduction method for decision formal contexts
- Reduction about approximation spaces of covering generalized rough sets
- Reduction method for concept lattices based on rough set theory and its application
- Theory and Applications of Relational Structures as Knowledge Instruments
- A comparison of two kinds of definitions of rough approximations based on a similarity relation
- Title not available (Why is that?)
- Attribute reduction theory and approach to concept lattice
- Title not available (Why is that?)
- Generalized probabilistic approximations of incomplete data
- Membership function based rough set
- 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
- Formal Topology and Information Systems
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Cited In (16)
- On some types of covering rough sets from topological points of view
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Comparison of reduction in formal decision contexts
- A fast attribute reduction method for large formal decision contexts
- Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
- Object-oriented interval-set concept lattices
- Relationship among basic concepts in covering-based rough sets
- Granular matrix method of attribute reduction in formal contexts
- Title not available (Why is that?)
- Evidence-theory-based numerical characterization of multigranulation rough sets in incomplete information systems
- Reductions of a covering approximation space from algebraic points of view
- Relationships between covering-based rough sets and relation-based rough sets
- Title not available (Why is that?)
- Dependence space models to construct concept lattices
- A rough set method for the vertex cover problem in graph theory
- Maps between covering approximation spaces and the product space of two covering approximation spaces
This page was built for publication: Connections between covering-based rough sets and concept lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473370)
