scientific article

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Galois connection complete lattice of concepts

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

Related Items

Cloud data processing using granular based weighted concept lattice and Hamming distance, Yoneda philosophy in engineering, On Tamari lattices, Generalized dimension of an ordered set and its MacNeille completion, The generalized doubling construction and formal concept analysis, Logical handling of uncertain, ontology-based, spatial information, Subdirect product construction of concept lattices, 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, A comprehensive survey on formal concept analysis, its research trends and applications, The role of a synthetic geometry in representational measurement theory, Lattices, closures systems and implication bases: a survey of structural aspects and algorithms, On finite lattices generated by their doubly irreducible elements, Relational concept analysis: mining concept lattices from multi-relational data, Relating attribute reduction in formal, object-oriented and property-oriented concept lattices, Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II., Fuzzy inference based on fuzzy concept lattice, Lattice-theoretic contexts and their concept lattices via Galois ideals, Negations and contrapositions of complete lattices, Similarity relations in fuzzy attribute-oriented concept lattices, Closure structures parameterized by systems of isotone Galois connections, A new algebraic structure for formal concept analysis, On limits and colimits of variety-based topological systems, On the complexity of enumerating pseudo-intents, 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, Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data, On lower and upper intension order relations by different cover concepts, Representing attribute reduction and concepts in concept lattice using graphs, The correspondence between the concepts in description logics for contexts and formal concept analysis, The presence of lattice theory in discrete problems of mathematical social sciences. Why., Power contexts and their concept lattices, On the order dimension of convex polytopes, Multi-adjoint property-oriented and object-oriented concept lattices, Knowledge reduction in real decision formal contexts, Multi-confidence rule acquisition and confidence-preserved attribute reduction in interval-valued decision systems, Attribute extended algorithm of lattice-valued concept lattice based on congener formal context, Three-way concept analysis for incomplete formal contexts, A formal framework for characterizing querying algorithms., Connections between covering-based rough sets and concept lattices, The skeletons of free distributive lattices, The use of linguistic variables and fuzzy propositions in the \(L\)-fuzzy concept theory, The Dedekind-MacNeille completion as a reflector, Aggregation of fuzzy preferences: A theoretic Arrow-like approach, Organization by rules in finite sequences, Formal query systems on contexts and a representation of algebraic lattices, Some decision and counting problems of the Duquenne-Guigues basis of implications, The conjunctive model of hierarchical classes, Bipolar fuzzy graph representation of concept lattice, A topological representation of lattices, Evolution in time of \(L\)-fuzzy context sequences, Three-way concept learning based on cognitive operators: an information fusion viewpoint, Concept lattices and conceptual knowledge systems, Foliated semantic networks: Concepts, facts, qualities, On multi-adjoint concept lattices based on heterogeneous conjunctors, Concept learning via granular computing: a cognitive viewpoint, The use of two relations in \( L\)-fuzzy contexts, Relations of reduction between covering generalized rough sets and concept lattices, An application of formal concept analysis to semantic neural decoding, Possibility theory and formal concept analysis: characterizing independent sub-contexts, Formal concept analysis based on fuzzy granularity base for different granulations, Algebras for Galois-style connections and their discrete duality, Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors, Valuations and closure operators on finite lattices, A heuristic knowledge-reduction method for decision formal contexts, Fuzzy graph representation of a fuzzy concept lattice, Reduction about approximation spaces of covering generalized rough sets, Minimal bases of temporal attribute implications, An efficient method to factorize fuzzy attribute-oriented concept lattices, Discovery of optimal factors in binary data via a novel method of matrix decomposition, An incremental algorithm to construct a lattice of set intersections, 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, Treatment of L-fuzzy contexts with absent values, Decision implication canonical basis: a logical perspective, Covering graphs with few complete bipartite subgraphs, Perfect error-correcting databases, Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs, Enumeration aspects of maximal cliques and bicliques, Attribute reduction in formal contexts based on a new discernibility matrix, A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations, Formal concept analysis via multi-adjoint concept lattices, Extensions and intensions in the rough set theory, Use of Choquet integrals in multivalued contexts, On cognitive preferences and the plausibility of rule-based models, Concept lattices defined from implication operators, Construction of the \(L\)-fuzzy concept lattice, An application of lattice theory to knowledge representation, Subdirect decomposition of concept lattices, Generalizing semidistributivity, Distributive laws for concept lattices, A note on the correspondence among entail relations, rough set dependencies, and logical consequence, Tensor products of contexts and complete lattices, The jump number and the lattice of maximal antichains, On context patterns associated with concept lattices, A fast algorithm for building lattices, Implicative analysis for multivariate binary data using an imprecise Dirichlet model, 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, Reduction method for concept lattices based on rough set theory and its application, Comparison of reduction in formal decision contexts, Using concept lattice theory to obtain the set of solutions of multi-adjoint relation equations, Concept-cognitive computing system for dynamic classification, Symbolic objects: Order structure and pyramidal clustering, Interval orders based on arbitrary ordered sets, Dimensionality of ordinal structures, Knowledge cores in large formal contexts, On stability of a formal concept, Relational concept discovery in structured datasets, Dedekind-MacNeille completion of \(n\)-ordered sets, Fast factorization by similarity in formal concept analysis of data with fuzzy attributes, Attribute reduction of SE-ISI concept lattices for incomplete contexts, Granular matrix method of attribute reduction in formal contexts, Bialgebraic contexts for finite distributive lattices, The interval parameter optimization model based on three-way decision space and its application on ``green products recommendation, Knowledge representation using interval-valued fuzzy formal concept lattice, Rules acquisition of formal decision contexts based on three-way concept lattices, Generalized textural rough sets: rough set models over two universes, Interface between logical analysis of data and formal concept analysis, On relationship between three-way concept lattices, Complex vague set based concept lattice, Dichotomic lattices and local discretization for Galois lattices, 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, Optimal decompositions of matrices with grades into binary and graded matrices, On the isomorphism problem of concept algebras, Parallel algorithm for computing fixpoints of Galois connections, \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields, Geometric lattice structure of covering-based rough sets through matroids, Formal concept analysis based on the topology for attributes of a formal context, Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis, A note on bipolar fuzzy graph representation of concept lattice, Min-max attribute-object bireducts: on unifying models of reducts in rough set theory, Variable threshold concept lattices, Set approximations in fuzzy formal concept analysis, Variable-precision three-way concepts in \textbf{L}-contexts, Graded polygons of opposition in fuzzy formal concept analysis, Rule extraction based on linguistic-valued intuitionistic fuzzy layered concept lattice, Textural dependency and concept lattices, A multiview approach for intelligent data analysis based on data operators, 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, Biclustering meets triadic concept analysis, Boolean factors as a means of clustering of interestingness measures of association rules, G. Czédli's tolerance factor lattice construction and weak ordered relations, Attribute reduction theory of concept lattice based on decision formal contexts, Vague concept lattice reduction using granular computing and vague entropy, A framework for incremental generation of closed itemsets, 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, Application of the \(L\)-fuzzy concept analysis in the morphological image and signal processing, Generalized domination in closure systems, Attribute reduction in intuitionistic fuzzy concept lattices, Rough sets based on Galois connections, Object-oriented interval-set concept lattices, Certain information granule system as a result of sets approximation by fuzzy context, Ontology-based concept similarity in formal concept analysis, Conjunctive query pattern structures: a relational database model for formal concept analysis, On the size of \(\exists \)-generalized concept lattices, Three-way cognitive concept learning via multi-granularity, Attribute reduction in generalized one-sided formal contexts, Feature selection and approximate reasoning of large-scale set-valued decision tables based on \(\alpha\)-dominance-based quantitative rough sets, A methodology for analysis of concept lattice reduction, A theoretical study on the object (property) oriented concept lattices based on three-way decisions, Soft concept lattice for formal concept analysis based on soft sets: theoretical foundations and applications, The fundamental theorem of finite semidistributive lattices, A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis, Three-way dual concept analysis, Textural formal context, Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context, Optimal granule level selection: a granule description accuracy viewpoint, Three-way granular computing, rough sets, and formal concept analysis, Incremental concept-cognitive learning based on attribute topology, Describing hierarchy of concept lattice by using matrix, Simplicial elimination schemes, extremal lattices and maximal antichain lattices, Rough set approaches in knowledge structures, How small can a lattice of order-dimension n be?, Regular monoids generated by two Galois connections, Bipolar fuzzy concept learning using next neighbor and Euclidean distance, Various fuzzy connections and fuzzy concepts in complete co-residuated lattices, From graphs to ortholattices and equivariant maps, Direct products of convex-ordinal scales, A comparative study of some soft rough sets, A constructing approach to multi-granularity object-induced three-way concept lattices, On the calculation of formal concept stability, Formal concept analysis perspectives on three-way conflict analysis, Concepts in fuzzy scaling theory: Order and granularity., Multi-adjoint fuzzy rough sets: definition, properties and attribute selection, The conceptual weak hierarchy associated with a dissimilarity measure, Axiomatic characterizations of dual concept lattices, A novel cognitive system model and approach to transformation of information granules, A new kind of implication to reason with unknown information, Triadic exploration and exploration with multiple experts, Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates, Scalable Visual Analytics in FCA, Unnamed Item, Algebraic structure of square matrices over residuated lattices, Quantifying the conceptual error in dimensionality reduction, A heuristic concept construction approach to collaborative recommendation, The structure theorem of three-way concept lattice, PRE and Variable Precision Models in Rough Set Data Analysis, Fuzzy concept lattice reduction using Shannon entropy and Huffman coding, Three-Way Formal Concept Analysis, Attribute exploration with multiple contradicting partial experts, Connecting concept lattices with bonds induced by external information, Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts, Robot path planning based on concept lattice, A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts, Triadic concept approximation, An updated method of granular reduct based on cognitive operators in formal contexts, What’s in a Relation? Logical Structures of Modes of Granulation, Tolerance Relations and Rough Approximations in Incomplete Contexts, On two types of concept lattices in the theory of numberings, Notes on the improvement of concept-cognitive learning accuracy, How to describe the spatial near-far relations among concepts?, Factorizing lattices by interval relations, Conceptual views on tree ensemble classifiers, Attribute granulation in fuzzy formal contexts based on \(L\)-fuzzy concepts, Kripke contexts, double Boolean algebras with operators and corresponding modal systems, Unnamed Item, Quasilattices and complex concept analysis, Contexts and sublattices of concept lattices, Retículos teóricos y el análisis de conceptos formales, herramientas para el estructuralismo metateórico, Knowledge discovery and updating under the evolution of network formal contexts based on three-way decision, Dynamic updating variable precision three-way concept method based on two-way concept-cognitive learning in fuzzy formal Contexts, Concept reduction of object-induced three-way concept lattices, Attribute reduction of crisp-crisp concept lattices based on three-way decisions, Optimal scale selection and knowledge discovery in generalized multi-scale decision tables, Formal concept analysis for the generation of plural referring expressions, A dynamic rule-based classification model via granular computing, Selection of appropriate bonds between \(\mathcal{L}\)-fuzzy formal contexts for recommendation tasks, Granule description with undetermined values in a three-way epistemic perspective, Three-way reduction for formal decision contexts, On the lattice of conceptual measurements, Knowledge Extraction from L-Fuzzy Hypercontexts, Representation of algebraic domains by formal association rule systems, Topological representation of double Boolean algebras, Unnamed Item, Unnamed Item, Unnamed Item, On the length of the lattice of sublattices of a finite distributive lattice, Algebraic Methods for Rough Approximation Spaces by Lattice Interior–Closure Operations, Rough Sets - Past, Present and Future: Some Notes, Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms, Unnamed Item, Transformations of Concept Graphs:, Fuzzy logical bidirectional associative memory, The study of the interval-valued contexts, Information Quanta and Approximation Operators: Once More Around the Track, Unnamed Item, Unnamed Item, On the Merge of Factor Canonical Bases, Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices, Unnamed Item, Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data, Generic Association Rule Bases: Are They so Succinct?, Towards an Iterative Classification Based on Concept Lattice, Far beyond the classical data models: symbolic data analysis, Unnamed Item, Factor Space and Normal Context on Concept Description, Rough Fuzzy Concept Lattice and Its Properties, Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators, Unnamed Item, Unnamed Item, An analysis of pitch-class segmentation in John Cage'sRyoanji for oboeusing morphological image analysis and formal concept analysis, Unnamed Item, Context Algebras, Context Frames, and Their Discrete Duality, Category-Based Inductive Reasoning: Rough Set Theoretic Approach, Formal Concept Analysis from the Standpoint of Possibility Theory, SOME PROPERTIES OF EXTENDED ORDER ALGEBRAS, FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES, WEAK EXTENDED ORDER ALGEBRAS HAVING ADJOINT TRIPLES, THE PROPERTIES OF FUZZY CONNECTIONS, MODAL, NECESSITY, SUFFICIENCY AND CO-SUFFICIENCY OPERATORS, Unnamed Item, Fuzzy Concept Lattices with Incomplete Knowledge, Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context, Weak Hierarchies: A Central Clustering Structure, St. Alasdair on Lattices Everywhere, Musical Descriptions Based on Formal Concept Analysis and Mathematical Morphology, A computational procedure for variable selection preserving different initial conditions