scientific article; zbMATH DE number 3771669
From MaRDI portal
Publication:3952147
zbMATH Open0491.06008MaRDI QIDQ3952147FDOQ3952147
Authors: Rudolf Wille
Publication date: 1982
Title of this publication is not available (Why is that?)
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)
- G. Czédli's tolerance factor lattice construction and weak ordered relations
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions
- Vague concept lattice reduction using granular computing and vague entropy
- A fast attribute reduction method for large formal decision contexts
- Textural dependency and concept lattices
- 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
- A new kind of implication to reason with unknown information
- Triadic exploration and exploration with multiple experts
- Graded polygons of opposition in fuzzy formal concept analysis
- \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields
- A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts
- Rule extraction based on linguistic-valued intuitionistic fuzzy layered concept lattice
- Textural formal context
- Rough sets based on Galois connections
- Title not available (Why is that?)
- Bialgebraic contexts for finite distributive lattices
- Concept-cognitive computing system for dynamic classification
- Object-oriented interval-set concept lattices
- Knowledge cores in large formal contexts
- Knowledge sharing in organizational structures
- Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices
- Concept reduction of object-induced three-way concept lattices
- Attribute reduction of SE-ISI concept lattices for incomplete contexts
- Granular matrix method of attribute reduction in formal contexts
- Min-max attribute-object bireducts: on unifying models of reducts in rough set theory
- Boolean factors as a means of clustering of interestingness measures of association rules
- Triadic concept approximation
- Combinatorics of \((m, n)\)-word lattices
- Describing hierarchy of concept lattice by using matrix
- Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis
- Three-way concept lattice from adjunctive positive and negative concepts
- Certain information granule system as a result of sets approximation by fuzzy context
- Conjunctive query pattern structures: a relational database model for formal concept analysis
- On the size of \(\exists \)-generalized concept lattices
- Rough set approaches in knowledge structures
- PRE and variable precision models in rough set data analysis
- Extracting attribute implications from a formal context: unifying the basic approaches
- Dependence space models to construct concept lattices
- Variable-precision three-way concepts in \textbf{L}-contexts
- Soft concept lattice for formal concept analysis based on soft sets: theoretical foundations and applications
- A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis
- Incremental concept-cognitive learning based on attribute topology
- Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context
- Optimal granule level selection: a granule description accuracy viewpoint
- Approximation operators based on preconcepts
- The interval parameter optimization model based on three-way decision space and its application on ``green products recommendation
- Granular concept-enhanced relational graph convolution networks for link prediction in knowledge graph
- Robot path planning based on concept lattice
- Various fuzzy connections and fuzzy concepts in complete co-residuated lattices
- Interface between logical analysis of data and formal concept analysis
- Rules acquisition of formal decision contexts based on three-way concept lattices
- Power contexts and their concept lattices
- Attribute reduction in generalized one-sided formal contexts
- A methodology for analysis of concept lattice reduction
- Decision implication canonical basis: a logical perspective
- Comparison of reduction in formal decision contexts
- Complex vague set based concept lattice
- Subdirect product construction of concept lattices
- FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES
- The skeletons of free distributive lattices
- Feature selection and approximate reasoning of large-scale set-valued decision tables based on \(\alpha\)-dominance-based quantitative rough sets
- A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations
- An application of formal concept analysis to semantic neural decoding
- Logical handling of uncertain, ontology-based, spatial information
- The conceptual weak hierarchy associated with a dissimilarity measure
- Valuations and closure operators on finite lattices
- Construction of the \(L\)-fuzzy concept lattice
- An application of lattice theory to knowledge representation
- Fuzzy logical bidirectional associative memory
- On finite lattices generated by their doubly irreducible elements
- Minimal bases of temporal attribute implications
- An efficient method to factorize fuzzy attribute-oriented concept lattices
- The generalized doubling construction and formal concept analysis
- Concept lattices and conceptual knowledge systems
- Three-way dual concept analysis
- A note on the correspondence among entail relations, rough set dependencies, and logical consequence
- Application of the \(L\)-fuzzy concept analysis in the morphological image and signal processing
- Multi-adjoint fuzzy rough sets: definition, properties and attribute selection
- On the isomorphism problem of concept algebras
- On the Merge of Factor Canonical Bases
- Using concept lattice theory to obtain the set of solutions of multi-adjoint relation equations
- A computational procedure for variable selection preserving different initial conditions
- Generalized domination in closure systems
- Basic theorem of fuzzy concept lattices revisited
- Formal concept analysis from the standpoint of possibility theory
- Concepts in fuzzy scaling theory: Order and granularity.
- An incremental algorithm to construct a lattice of set intersections
- Conceptual views on tree ensemble classifiers
- Weak Hierarchies: A Central Clustering Structure
- Rough fuzzy concept lattice and its properties
- Contexts and sublattices of concept lattices
- Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II.
- Interval orders based on arbitrary ordered sets
- Algebras for Galois-style connections and their discrete duality
- Aggregation of fuzzy preferences: A theoretic Arrow-like approach
- Computational aspects of the 2-dimension of partially ordered sets
- Galois lattice as a framework to specify building class hierarchies algorithms
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- Generalizations of Boolean algebras. An attribute exploration
- On the order dimension of convex polytopes
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)