Attribute reduction in multi-adjoint concept lattices
From MaRDI portal
Publication:526654
Recommendations
- Attribute and size reduction mechanisms in multi-adjoint concept lattices
- A Novel Approach to Attribute Reduction in Concept Lattices
- Attribute reduction theory and approach to concept lattice
- The structure of an attribute reduction set of concept lattices
- Characterizing reducts in multi-adjoint concept lattices
- Attribute reduction of concept lattice based on irreducible elements
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Attribute Reduction in Object Oriented Concept Lattices Based on Congruence Relations
Cites work
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- A Generalized Concept Lattice
- A comparative study of adjoint triples
- An entropy-based weighted concept lattice for merging multi-source geo-ontologies
- Application of the \(L\)-fuzzy concept analysis in the morphological image and signal processing
- Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. I.
- Attribute reduction based on generalized fuzzy evidence theory in fuzzy decision systems
- Attribute selection with fuzzy decision reducts
- Concept analysis via rough set and AFS algebra
- Concept lattices and order in fuzzy logic
- Construction of the \(L\)-fuzzy concept lattice
- Formal Concept Analysis
- Formal concept analysis via multi-adjoint concept lattices
- Fuzzy-rough nearest neighbour classification and prediction
- Isotone fuzzy Galois connections with hedges
- Knowledge reduction in real decision formal contexts
- Metamathematics of fuzzy logic
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
- Multi-adjoint fuzzy rough sets: definition, properties and attribute selection
- Multi-adjoint relation equations: definition, properties and solutions using concept lattices
- Multi-adjoint t-concept lattices
- Non-commutative fuzzy Galois connections
- On equivalence of conceptual scaling and generalized one-sided concept lattices
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Representation of fuzzy concept lattices in the framework of classical FCA
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Rough set model based on formal concept analysis
- Rough sets
- Solving systems of fuzzy relation equations by fuzzy property-oriented concepts
Cited in
(33)- A weakened notion of congruence to reduce concept lattices
- Characterization of the infimum of classes induced by an attribute reduction in FCA
- Impact of local congruences in variable selection from datasets
- Knowledge implications in multi-adjoint concept lattices
- Attribute reduction of concept lattice based on irreducible elements
- 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
- On the use of thresholds in multi-adjoint concept lattices.
- On stability of fuzzy formal concepts over randomized one-sided formal context
- A computational procedure for variable selection preserving different initial conditions
- Impact Zadeh's theory to algebraic structures. Multi-adjoint algebras
- Bireducts in Formal Concept Analysis
- Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis
- Representation of fuzzy subsets by Galois connections
- Knowledge Reduction in Concept Lattices Based on Irreducible Elements
- Characterizing reducts in multi-adjoint concept lattices
- Multi-adjoint concept lattices via quantaloid-enriched categories
- Factorizing formal contexts from closures of necessity operators
- scientific article; zbMATH DE number 6470657 (Why is no real title available?)
- Implication operators generating pairs of weak negations and their algebraic structure
- Adjoint negations, more than residuated negations
- Reducing concept lattices by means of a weaker notion of congruence
- Attribute Reduction in Object Oriented Concept Lattices Based on Congruence Relations
- A Novel Approach to Attribute Reduction in Concept Lattices
- L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size
- Knowledge reduction in crisply generated fuzzy concept lattices
- Attribute reduction of relative knowledge granularity in intuitionistic fuzzy ordered decision table
- Three-way attribute reducts
- Attribute and size reduction mechanisms in multi-adjoint concept lattices
- Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context
- Algebraic structure and characterization of adjoint triples
- Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices
- Generalized quantifiers in formal concept analysis
- Unifying reducts in formal concept analysis and rough set theory
This page was built for publication: Attribute reduction in multi-adjoint concept lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526654)
