Multi-adjoint fuzzy rough sets: definition, properties and attribute selection
From MaRDI portal
Publication:2353686
DOI10.1016/j.ijar.2013.09.007zbMath1316.03028OpenAlexW1965429189MaRDI QIDQ2353686
Nele Verbiest, Jesús Medina, Chris Cornelis
Publication date: 16 July 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2013.09.007
Theory of fuzzy sets, etc. (03E72) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (29)
GENERALIZED RESIDUATED LATTICES BASED F-TRANSFORM ⋮ Adjoint negations, more than residuated negations ⋮ Right adjoint algebras versus operator left residuated posets ⋮ Recent fuzzy generalisations of rough sets theory: a systematic review and methodological critique of the literature ⋮ Preferences in discrete multi-adjoint formal concept analysis ⋮ Rough set decision algorithms for modeling with uncertainty ⋮ Multi-adjoint lattice logic and truth-stressing hedges ⋮ Algebraic structure and characterization of adjoint triples ⋮ A logical characterization of multi-adjoint algebras ⋮ Multi-granularity distance measure for interval-valued intuitionistic fuzzy concepts ⋮ Three-way decision-based co-detection for outliers ⋮ Bireducts with tolerance relations ⋮ On the impact of sup‐compositions in the resolution of multi‐adjoint relation equations ⋮ Approximating fuzzy relation equations through concept lattices ⋮ Multi-adjoint algebras versus non-commutative residuated structures ⋮ Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis ⋮ Attribute reduction in multi-adjoint concept lattices ⋮ Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. ⋮ Rough sets based on Galois connections ⋮ Unnamed Item ⋮ Implication operators generating pairs of weak negations and their algebraic structure ⋮ Multi-adjoint concept lattices via quantaloid-enriched categories ⋮ Algebraic structure of fuzzy signatures ⋮ Generalized quantifiers in formal concept analysis ⋮ Three-way decision with incomplete information based on similarity and satisfiability ⋮ Characterizing reducts in multi-adjoint concept lattices ⋮ General \(L\)-fuzzy aggregation functions based on complete residuated lattices ⋮ Parameterized maximum-entropy-based three-way approximate attribute reduction ⋮ A computational procedure for variable selection preserving different initial conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Multi-adjoint property-oriented and object-oriented concept lattices
- A comparative study of adjoint triples
- Attribute selection with fuzzy decision reducts
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
- Formal concept analysis via multi-adjoint concept lattices
- Metamathematics of fuzzy logic
- A comparative study of fuzzy rough sets
- Axiomatic characterizations of dual concept lattices
- Reduction method for concept lattices based on rough set theory and its application
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- The concept lattice functors
- A multiview approach for intelligent data analysis based on data operators
- Rough sets
- Rough Sets and Current Trends in Computing
- Scale Coarsening as Feature Selection
- Theory and Applications of Relational Structures as Knowledge Instruments
- A Formal Concept Analysis Approach to Rough Data Tables
This page was built for publication: Multi-adjoint fuzzy rough sets: definition, properties and attribute selection
