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)
- 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
- Attribute reduction in formal contexts based on a new discernibility matrix
- Use of Choquet integrals in multivalued contexts
- On cognitive preferences and the plausibility of rule-based models
- Title not available (Why is that?)
- From graphs to ortholattices and equivariant maps
- Biclustering meets triadic concept analysis
- On the length of the lattice of sublattices of a finite distributive lattice
- Topological representation of double Boolean algebras
- Geometric lattice structure of covering-based rough sets through matroids
- Representing attribute reduction and concepts in concept lattice using graphs
- Evolution in time of \(L\)-fuzzy context sequences
- The jump number and the lattice of maximal antichains
- The study of the interval-valued contexts
- Context Algebras, Context Frames, and Their Discrete Duality
- Dedekind-MacNeille completion of \(n\)-ordered sets
- Bireducts with tolerance relations
- A novel cognitive system model and approach to transformation of information granules
- Generalizing semidistributivity
- Monotone concepts for formal concept analysis
- Treatment of L-fuzzy contexts with absent values
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- On limits and colimits of variety-based topological systems
- Yoneda philosophy in engineering
- The conjunctive model of hierarchical classes
- Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
- Concept lattices and order in fuzzy logic
- Three-way formal concept analysis
- Ontology-based concept similarity in formal concept analysis
- A constructing approach to multi-granularity object-induced three-way concept lattices
- On Tamari lattices
- Reduction method for concept lattices based on rough set theory and its application
- Representations and dualities for bounded lattices
- A multiview approach for intelligent data analysis based on data operators
- A note on bipolar fuzzy graph representation of concept lattice
- Extensions and intensions in the rough set theory
- Three-way cognitive concept learning via multi-granularity
- A new algebraic structure for formal concept analysis
- On lower and upper intension order relations by different cover concepts
- Covering graphs with few complete bipartite subgraphs
- Connections between covering-based rough sets and concept lattices
- A framework for incremental generation of closed itemsets
- The Dedekind-MacNeille completion as a reflector
- The correspondence between the concepts in description logics for contexts and formal concept analysis
- On relationship between three-way concept lattices
- The structure theorem of three-way concept lattice
- Distributive laws for concept lattices
- Formal concept analysis via multi-adjoint concept lattices
- Fuzzy concept lattice reduction using Shannon entropy and Huffman coding
- Set approximations in fuzzy formal concept analysis
- Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
- An incremental concept formation approach for learning from databases
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)