scientific article; zbMATH DE number 3771669

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Structure theory of lattices (06B05) Representation theory of lattices (06B15) Complete lattices, completions (06B23)

Cited in

(only showing first 100 items - show all)

Computational aspects of the 2-dimension of partially ordered sets
Representing attribute reduction and concepts in concept lattice using graphs
The generalized doubling construction and formal concept analysis
Concepts in fuzzy scaling theory: Order and granularity.
Context Algebras, Context Frames, and Their Discrete Duality
An application of lattice theory to knowledge representation
Rough fuzzy concept lattice and its properties
An incremental algorithm to construct a lattice of set intersections
Aggregation of fuzzy preferences: A theoretic Arrow-like approach
The conceptual weak hierarchy associated with a dissimilarity measure
Geometric lattice structure of covering-based rough sets through matroids
Subdirect product construction of concept lattices
A computational procedure for variable selection preserving different initial conditions
On the isomorphism problem of concept algebras
Use of Choquet integrals in multivalued contexts
On cognitive preferences and the plausibility of rule-based models
Decision implication canonical basis: a logical perspective
From graphs to ortholattices and equivariant maps
Valuations and closure operators on finite lattices
FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES
Generalized domination in closure systems
On the Merge of Factor Canonical Bases
Galois lattice as a framework to specify building class hierarchies algorithms
Evolution in time of \(L\)-fuzzy context sequences
A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations
Interval orders based on arbitrary ordered sets
Power contexts and their concept lattices
Comparison of reduction in formal decision contexts
Using concept lattice theory to obtain the set of solutions of multi-adjoint relation equations
The jump number and the lattice of maximal antichains
Concept lattices and conceptual knowledge systems
Biclustering meets triadic concept analysis
Multi-adjoint fuzzy rough sets: definition, properties and attribute selection
Minimal bases of temporal attribute implications
The study of the interval-valued contexts
An efficient method to factorize fuzzy attribute-oriented concept lattices
The presence of lattice theory in discrete problems of mathematical social sciences. Why.
Dedekind-MacNeille completion of \(n\)-ordered sets
Generalizations of Boolean algebras. An attribute exploration
On finite lattices generated by their doubly irreducible elements
Conceptual views on tree ensemble classifiers
An application of formal concept analysis to semantic neural decoding
Basic theorem of fuzzy concept lattices revisited
Three-way dual concept analysis
Application of the \(L\)-fuzzy concept analysis in the morphological image and signal processing
Algebras for Galois-style connections and their discrete duality
On the length of the lattice of sublattices of a finite distributive lattice
Attribute reduction in generalized one-sided formal contexts
A methodology for analysis of concept lattice reduction
The skeletons of free distributive lattices
scientific article; zbMATH DE number 1513330 (Why is no real title available?)
Contexts and sublattices of concept lattices
Complex vague set based concept lattice
Feature selection and approximate reasoning of large-scale set-valued decision tables based on \(\alpha\)-dominance-based quantitative rough sets
Topological representation of double Boolean algebras
On the order dimension of convex polytopes
Weak Hierarchies: A Central Clustering Structure
Attribute reduction in formal contexts based on a new discernibility matrix
A note on the correspondence among entail relations, rough set dependencies, and logical consequence
Fuzzy logical bidirectional associative memory
Construction of the \(L\)-fuzzy concept lattice
Logical handling of uncertain, ontology-based, spatial information
Bireducts with tolerance relations
Formal concept analysis from the standpoint of possibility theory
Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II.
Relational concept analysis: mining concept lattices from multi-relational data
Generalized textural rough sets: rough set models over two universes
Relational concept discovery in structured datasets
On relationship between three-way concept lattices
The structure theorem of three-way concept lattice
Axiomatic characterizations of dual concept lattices
Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
Formal query systems on contexts and a representation of algebraic lattices
Distributive laws for concept lattices
Yoneda philosophy in engineering
A fast algorithm for building lattices
A novel cognitive system model and approach to transformation of information granules
Factorizing lattices by interval relations
Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
On lower and upper intension order relations by different cover concepts
Generalizing semidistributivity
Bipolar fuzzy graph representation of concept lattice
Possibility theory and formal concept analysis: characterizing independent sub-contexts
The use of linguistic variables and fuzzy propositions in the \(L\)-fuzzy concept theory
Monotone concepts for formal concept analysis
Three-way cognitive concept learning via multi-granularity
Discovery of optimal factors in binary data via a novel method of matrix decomposition
Representations and dualities for bounded lattices
The Dedekind-MacNeille completion as a reflector
Concept learning via granular computing: a cognitive viewpoint
Relations of reduction between covering generalized rough sets and concept lattices
The use of two relations in \( L\)-fuzzy contexts
On limits and colimits of variety-based topological systems
Concept lattices and order in fuzzy logic
Complexity of learning in concept lattices from positive and negative examples
Covering graphs with few complete bipartite subgraphs
On multi-adjoint concept lattices based on heterogeneous conjunctors
Formal concept analysis via multi-adjoint concept lattices
Three-way formal concept analysis
Fast factorization by similarity in formal concept analysis of data with fuzzy attributes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3952147)