scientific article; zbMATH DE number 3771669
From MaRDI portal
Publication:3952147
Cited in
(only showing first 100 items - show all)- An incremental algorithm to construct a lattice of set intersections
- Treatment of L-fuzzy contexts with absent values
- Covering graphs with few complete bipartite subgraphs
- Enumeration aspects of maximal cliques and bicliques
- Attribute reduction in formal contexts based on a new discernibility matrix
- Formal concept analysis via multi-adjoint concept lattices
- Subdirect product construction of concept lattices
- On finite lattices generated by their doubly irreducible elements
- The skeletons of free distributive lattices
- The Dedekind-MacNeille completion as a reflector
- Aggregation of fuzzy preferences: A theoretic Arrow-like approach
- Organization by rules in finite sequences
- A topological representation of lattices
- Concept lattices and conceptual knowledge systems
- Foliated semantic networks: Concepts, facts, qualities
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- A generic disjunctive/conjunctive decomposition model for n-ary relations
- Extensions and intensions in the rough set theory
- Construction of the \(L\)-fuzzy concept lattice
- Generalizing semidistributivity
- Distributive laws for concept lattices
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Tensor products of contexts and complete lattices
- On context patterns associated with concept lattices
- On Tamari lattices
- Generalized dimension of an ordered set and its MacNeille completion
- The generalized doubling construction and formal concept analysis
- An incremental concept formation approach for learning from databases
- Computing on-line the lattice of maximal antichains of posets
- On extending closure systems to matroids
- The role of a synthetic geometry in representational measurement theory
- Negations and contrapositions of complete lattices
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- A formal framework for characterizing querying algorithms.
- Concept lattices defined from implication operators
- An application of lattice theory to knowledge representation
- A note on the correspondence among entail relations, rough set dependencies, and logical consequence
- A fast algorithm for building lattices
- Implicative analysis for multivariate binary data using an imprecise Dirichlet model
- Cloud data processing using granular based weighted concept lattice and Hamming distance
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Lattice-theoretic contexts and their concept lattices via Galois ideals
- Similarity relations in fuzzy attribute-oriented concept lattices
- Closure structures parameterized by systems of isotone Galois connections
- Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras
- On stability of fuzzy formal concepts over randomized one-sided formal context
- Basic theorem of fuzzy concept lattices revisited
- Representing attribute reduction and concepts in concept lattice using graphs
- Attribute extended algorithm of lattice-valued concept lattice based on congener formal context
- Three-way concept analysis for incomplete formal contexts
- Evolution in time of \(L\)-fuzzy context sequences
- Possibility theory and formal concept analysis: characterizing independent sub-contexts
- Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors
- Locally complete consistent F-augmented contexts: a category-theoretic representation of algebraic L-domains
- Representation of lattices via set-colored posets
- A single axiom for Boolean algebras
- Perfect error-correcting databases
- Simplicial elimination schemes, extremal lattices and maximal antichain lattices
- How small can a lattice of order-dimension n be?
- Regular monoids generated by two Galois connections
- From graphs to ortholattices and equivariant maps
- Direct products of convex-ordinal scales
- Concepts in fuzzy scaling theory: Order and granularity.
- The conceptual weak hierarchy associated with a dissimilarity measure
- Concept lattices and order in fuzzy logic
- Complexity of learning in concept lattices from positive and negative examples
- Computational aspects of the 2-dimension of partially ordered sets
- Monotone concepts for formal concept analysis
- Symbolic objects: Order structure and pyramidal clustering
- Interval orders based on arbitrary ordered sets
- Dimensionality of ordinal structures
- Bialgebraic contexts for finite distributive lattices
- Geometric lattice structure of covering-based rough sets through matroids
- Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis
- Medical diagnoses using three-way fuzzy concept lattice and their Euclidean distance
- G. Czédli's tolerance factor lattice construction and weak ordered relations
- Vague concept lattice reduction using granular computing and vague entropy
- A fast attribute reduction method for large formal decision contexts
- 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
- Attribute reduction in intuitionistic fuzzy concept lattices
- Rough sets based on Galois connections
- The fundamental theorem of finite semidistributive lattices
- Describing hierarchy of concept lattice by using matrix
- Rough set approaches in knowledge structures
- Various fuzzy connections and fuzzy concepts in complete co-residuated lattices
- A constructing approach to multi-granularity object-induced three-way concept lattices
- Formal concept analysis perspectives on three-way conflict analysis
- A new kind of implication to reason with unknown information
- Triadic exploration and exploration with multiple experts
- Concept-cognitive computing system for dynamic classification
- Knowledge cores in large formal contexts
- Attribute reduction of SE-ISI concept lattices for incomplete contexts
- Granular matrix method of attribute reduction in formal contexts
- Interface between logical analysis of data and formal concept analysis
- Approximation operators based on preconcepts
- Dependence space models to construct concept lattices
- Bireducts with tolerance relations
- A note on similarity relations between fuzzy attribute-oriented concept lattices
- \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields
- Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis
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)
