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)
- 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
- Fuzzy Concept Lattices with Incomplete Knowledge
- Fuzzy inference based on fuzzy concept lattice
- Concept lattices defined from implication operators
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Multi-confidence rule acquisition and confidence-preserved attribute reduction in interval-valued decision systems
- A comprehensive survey on formal concept analysis, its research trends and applications
- Relational concept analysis: mining concept lattices from multi-relational data
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Factorizing lattices by interval relations
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Implicative analysis for multivariate binary data using an imprecise Dirichlet model
- Knowledge reduction in real decision formal contexts
- Multi-adjoint property-oriented and object-oriented concept lattices
- Formal query systems on contexts and a representation of algebraic lattices
- Bipolar fuzzy graph representation of concept lattice
- 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
- A heuristic knowledge-reduction method for decision formal contexts
- The use of linguistic variables and fuzzy propositions in the \(L\)-fuzzy concept theory
- On multi-adjoint concept lattices based on heterogeneous conjunctors
- Formal concept analysis based on fuzzy granularity base for different granulations
- Relational concept discovery in structured datasets
- Attribute reduction theory of concept lattice based on decision formal contexts
- Complexity of learning in concept lattices from positive and negative examples
- Computing on-line the lattice of maximal antichains of posets
- Far beyond the classical data models: symbolic data analysis
- Parallel algorithm for computing fixpoints of Galois connections
- Optimal decompositions of matrices with grades into binary and graded matrices
- Variable threshold concept lattices
- A topological representation of lattices
- Reduction about approximation spaces of covering generalized rough sets
- Representation of algebraic domains by formal association rule systems
- Generalized textural rough sets: rough set models over two universes
- Similarity relations in fuzzy attribute-oriented concept lattices
- Possibility theory and formal concept analysis: characterizing independent sub-contexts
- SOME PROPERTIES OF EXTENDED ORDER ALGEBRAS
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Fuzzy graph representation of a fuzzy concept lattice
- Enumeration aspects of maximal cliques and bicliques
- Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis
- On the complexity of enumerating pseudo-intents
- Three-way concept learning based on cognitive operators: an information fusion viewpoint
- Subdirect decomposition of concept lattices
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Axiomatic characterizations of dual concept lattices
- A fast algorithm for building lattices
- Knowledge representation using interval-valued fuzzy formal concept lattice
- Formal concept analysis based on the topology for attributes of a formal context
- Interface between logical analysis of data and formal concept analysis
- Rules acquisition of formal decision contexts based on three-way concept lattices
- Invertible square matrices over residuated lattices
- The fundamental theorem of finite semidistributive lattices
- Direct products of convex-ordinal scales
- Dimensionality of ordinal structures
- Algebraic methods for rough approximation spaces by lattice interior-closure operations
- Simplicial elimination schemes, extremal lattices and maximal antichain lattices
- On the calculation of formal concept stability
- Attribute extended algorithm of lattice-valued concept lattice based on congener formal context
- Three-way concept analysis for incomplete formal contexts
- An incremental method for the construction of the box extents of a context
- On stability of a formal concept
- G. Czédli's tolerance factor lattice construction and weak ordered relations
- Bipolar fuzzy concept learning using next neighbor and Euclidean distance
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions
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)