scientific article; zbMATH DE number 1249514
From MaRDI portal
Publication:4230685
zbMath0909.06001MaRDI QIDQ4230685
Publication date: 8 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
tensormeasuresatlasdecompositioncomplete latticesautomorphismsdistributivitylattice theoryformal concept analysisGalois connectionsmodularitypartial orderingconcept latticesglueingformal contextshierarchies of concepts
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complete lattices, completions (06B23) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)
Related Items
Unnamed Item ⋮ Towards Distributivity in FCA for Phylogenetic Data ⋮ Dual digraphs of finite semidistributive lattices ⋮ Notes on join semidistributive lattices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Trend analysis in L-fuzzy contexts with absent values ⋮ On Problem of Finding all Maximal Induced Bicliques of Hypergraph ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ Attribute exploration with multiple contradicting partial experts ⋮ Orbital concept lattices ⋮ Semiotic conceptual analysis of part-whole relationships in diagrams ⋮ Contra Continuity Properties of Relations in Relator Spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Connecting concept lattices with bonds induced by external information ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ Generalized decision directed acyclic graphs for classification tasks ⋮ Systematic categorization and evaluation of CbO-based algorithms in FCA ⋮ Triadic concept approximation ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Analogical Proportions and Binary Trees ⋮ Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets ⋮ On formal concepts of random formal contexts ⋮ Formal Concepts and Residuation on Multilattices ⋮ An updated method of granular reduct based on cognitive operators in formal contexts ⋮ Powerset operators induced by fuzzy relations as a basis for fuzzification of various mathematical structures ⋮ Representations for the largest extension of a closure system ⋮ On two types of concept lattices in the theory of numberings ⋮ A set-theoretic representation of algebraic L-domains ⋮ How to describe the spatial near-far relations among concepts? ⋮ Factorizing lattices by interval relations ⋮ On nontrivial weak dicomplementations and the lattice congruences that preserve them ⋮ Conceptual views on tree ensemble classifiers ⋮ Interval-dismantling for lattices ⋮ Formal concept analysis approach to understand digital evidence relationships ⋮ Kripke contexts, double Boolean algebras with operators and corresponding modal systems ⋮ m-Algebraic lattices in formal concept analysis ⋮ Mining for Unknown Unknowns ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ An efficient conflict analysis method based on splitting and merging of formal contexts ⋮ Knowledge Extraction from L-Fuzzy Hypercontexts ⋮ Towards Galois Connections over Positive Semifields ⋮ Many Faces of Lattice Tolerances ⋮ Unnamed Item ⋮ Lattice logic as a fragment of (2-sorted) residuated modal logic ⋮ Tight lower bounds on the number of bicliques in false-twin-free graphs ⋮ Tight lower bounds on the number of bicliques in false-twin-free graphs ⋮ Formal Concept Analysis with Constraints by EM Operators ⋮ Domain Endurants ⋮ Continuous Domains in Formal Concept Analysis* ⋮ Using difunctional relations in information organization ⋮ Unnamed Item ⋮ Compositionality: Ontology and Mereology of Domains ⋮ System Consequence ⋮ Interface of global and local semantics in a self-navigating system based on the concept lattice ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit ⋮ The Number of Plane Diagrams of a Lattice ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On the Merge of Factor Canonical Bases ⋮ Scale Coarsening as Feature Selection ⋮ Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer ⋮ Contingency Structures and Concept Analysis ⋮ Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Closure Systems of Equivalence Relations and Their Labeled Class Geometries ⋮ Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Means ⋮ Graded LinClosure and Its Role in Relational Data Analysis ⋮ Efficient Generic Association Rules Based Classifier Approach ⋮ Generic Association Rule Bases: Are They so Succinct? ⋮ Unique Factorization Theorem and Formal Concept Analysis ⋮ Towards Concise Representation for Taxonomies of Epistemic Communities ⋮ Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network ⋮ A Formal Concept Analysis Approach to Rough Data Tables ⋮ On Fuzzy Generalizations of Concept Lattices ⋮ Unifying Reducts in Formal Concept Analysis and Rough Set Theory ⋮ Modal translation of substructural logics ⋮ Antitone L-bonds ⋮ Unnamed Item ⋮ Context Algebras, Context Frames, and Their Discrete Duality ⋮ Quantitative Redundancy in Partial Implications ⋮ Formal Concept Analysis from the Standpoint of Possibility Theory ⋮ Formal Concept Analysis and Information Retrieval – A Survey ⋮ Extensional Confluences and Local Closure Operators ⋮ Totally Balanced Formal Context Representation ⋮ Randomized Fuzzy Formal Contexts and Relevance of One-Sided Concepts ⋮ Revisiting Pattern Structure Projections ⋮ Exploring Faulty Data ⋮ Towards a Navigation Paradigm for Triadic Concepts ⋮ A Proposal for Extending Formal Concept Analysis to Knowledge Graphs ⋮ Simple Undirected Graphs as Formal Contexts ⋮ Membership Functions ⋮ A Method for Reduction of Fuzzy Relation in Fuzzy Formal Context ⋮ Thinking Ultrametrically, Thinking p-Adically ⋮ An Efficient Approximation of Concept Stability Using Low-Discrepancy Sampling ⋮ Musical Descriptions Based on Formal Concept Analysis and Mathematical Morphology ⋮ Towards Collaborative Conceptual Exploration ⋮ Isbell adjunctions and Kan adjunctions via quantale-enriched two-variable adjunctions ⋮ Generalizing topological set operators ⋮ Complexity reduction and approximation of multidomain systems of partially ordered data ⋮ Knowledge cores in large formal contexts ⋮ Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ A dynamic approach for updating the lower approximation in adjustable multi-granulation rough sets ⋮ Granular matrix method of attribute reduction in formal contexts ⋮ On compound mixed concepts ⋮ Fuzzy closure systems: motivation, definition and properties ⋮ Algebraic machine learning: emphasis on efficiency ⋮ Triclusters of close values for the analysis of 3D data ⋮ Interface between logical analysis of data and formal concept analysis ⋮ Approximation operators based on preconcepts ⋮ On consistent functions for neighborhood systems ⋮ Constructing three-way concept lattice based on the composite of classical lattices ⋮ Dependence space models to construct concept lattices ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Discovery of link keys in resource description framework datasets based on pattern structures ⋮ Retículos teóricos y el análisis de conceptos formales, herramientas para el estructuralismo metateórico ⋮ Bireducts with tolerance relations ⋮ Interval-valued fuzzy morphological associative memories: some theoretical aspects and applications ⋮ On the impact of sup‐compositions in the resolution of multi‐adjoint relation equations ⋮ Doubly-lexical order supports standardisation and recursive partitioning of formal context ⋮ Graph-FCA meets pattern structures ⋮ On the commutative diagrams among Galois connections involved in closure structures ⋮ Scaling dimension ⋮ Three views on dependency covers from an FCA perspective ⋮ Description quivers for compact representation of concept lattices and ensembles of decision trees ⋮ On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) ⋮ Relational concept analysis in practice: capitalizing on data modeling using design patterns ⋮ Representing concept lattices with Euler diagrams ⋮ Cost-aware sequential diagnostics ⋮ Dynamic updating variable precision three-way concept method based on two-way concept-cognitive learning in fuzzy formal Contexts ⋮ Graph neural networks induced by concept lattices for classification ⋮ Rule acquisition in generalized one-sided decision systems ⋮ Concept reduction of object-induced three-way concept lattices ⋮ Close contact detection in social networks via possible attribute analysis ⋮ Concept and attribute reduction based on rectangle theory of formal concept ⋮ Toward quality assessment of Boolean matrix factorizations ⋮ A note on cuts of lattice-valued functions and concept lattices ⋮ Drawing Order Diagrams Through Two-Dimension Extension ⋮ Choice-free topological duality for implicative lattices and Heyting algebras ⋮ 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 ⋮ Fuzzy-based concept-cognitive learning: an investigation of novel approach to tumor diagnosis analysis ⋮ Ordinal motifs in lattices ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields ⋮ On the efficient stability computation for the selection of interesting formal concepts ⋮ L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size ⋮ Three-way reduction for formal decision contexts ⋮ On the lattice of conceptual measurements ⋮ Generalizations of some ordinary and extreme connectedness properties of topological spaces to relator spaces ⋮ From-below Boolean matrix factorization algorithm based on MDL ⋮ Document plagiarism detection using a new concept similarity in formal concept analysis ⋮ Set visualisations with Euler and Hasse diagrams ⋮ The fundamental theorem of finite semidistributive lattices ⋮ Reducing concept lattices by means of a weaker notion of congruence ⋮ If structured propositions are logical procedures then how are procedures individuated? ⋮ Quasi-closed elements in fuzzy posets ⋮ Impact of local congruences in variable selection from datasets ⋮ Generalized quantifiers in formal concept analysis ⋮ Rough set approaches in knowledge structures ⋮ A representation of FS-domains by formal concept analysis ⋮ Editorial. Formal concept analysis, rough sets, and three-way decisions ⋮ Intrinsic dimension of geometric data sets ⋮ Notes on integer partitions ⋮ Steps towards causal Formal Concept Analysis ⋮ Typicality: a formal concept analysis account ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ Ordinary, super and hyper relators can be used to treat the various generalized open sets in a unified way ⋮ Set-theoretic properties of generalized topologically open sets in relator spaces ⋮ A constructing approach to multi-granularity object-induced three-way concept lattices ⋮ Model theory of subject domains. I ⋮ A weakened notion of congruence to reduce concept lattices ⋮ Interactive search by using minimal generators ⋮ Knowledge implications in multi-adjoint concept lattices ⋮ On some categories underlying knowledge graphs ⋮ Computing triadic generators and association rules from triadic contexts ⋮ On pruning techniques in map-reduce style CbO algorithms ⋮ A semiotic perspective on polysemy ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis ⋮ Representing partition lattices through FCA ⋮ Fixed-point semantics for barebone relational concept analysis ⋮ Boolean substructures in formal concept analysis ⋮ Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis ⋮ Approximate computation of exact association rules ⋮ An incremental recomputation of from-below Boolean matrix factorization ⋮ Clustering and identification of core implications ⋮ Extracting relations in texts with concepts of neighbours ⋮ Triadic exploration and exploration with multiple experts ⋮ Visualization of statistical information in concept lattice diagrams ⋮ Force-directed layout of order diagrams using dimensional reduction ⋮ Sandwich: an algorithm for discovering relevant link keys in an LKPS concept lattice ⋮ Decision concept lattice vs. decision trees and random forests ⋮ Exploring scale-measures of data sets ⋮ Filters, ideals and congruences on double Boolean algebras ⋮ Diagrammatic representation of conceptual structures ⋮ On computing the Galois lattice of bipartite distance hereditary graphs ⋮ Computing the least common subsumer w.r.t. a background terminology ⋮ A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators ⋮ Reduction method for concept lattices based on rough set theory and its application ⋮ Comparison of reduction in formal decision contexts ⋮ Soft rough approximation operators and related results ⋮ Optimal factorization of three-way binary data using triadic concepts ⋮ Rough sets approach to symbolic value partition ⋮ On stability of a formal concept ⋮ The Galois lattice as a hierarchical structure for topological relations ⋮ Relational concept discovery in structured datasets ⋮ Attribute-incremental construction of the canonical implication basis ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ A local approach to concept generation ⋮ Dedekind-MacNeille completion of \(n\)-ordered sets ⋮ Fast factorization by similarity in formal concept analysis of data with fuzzy attributes ⋮ On the notion of concept. I ⋮ Approaches to knowledge reduction in generalized consistent decision formal context ⋮ Grouping fuzzy sets by similarity ⋮ On very true operators on pocrims ⋮ Fixed points of adjoint functors enriched in a quantaloid ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Knowledge representation using interval-valued fuzzy formal concept lattice ⋮ Decision bireducts and decision reducts -- a comparison ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Complex vague set based concept lattice ⋮ Dependency structures for decision tables ⋮ Duality results for (co)residuated lattices ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ Optimal decompositions of matrices with grades into binary and graded matrices ⋮ On the connection between many-valued contexts and general geometric structures ⋮ Factorization of fuzzy concept lattices with hedges by modification of input data ⋮ Generalization of association rules through disjunction ⋮ On the isomorphism problem of concept algebras ⋮ A formal concept analysis of harmonic forms and interval structures ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Closure-based constraints in formal concept analysis ⋮ A convexity upper bound for the number of maximal bicliques of a bipartite graph ⋮ Counting proper mergings of chains and antichains ⋮ Rough sets determined by tolerances ⋮ Variable threshold concept lattices ⋮ Set approximations in fuzzy formal concept analysis ⋮ On the join dependency relation in multinomial lattices ⋮ A multiview approach for intelligent data analysis based on data operators ⋮ Rough fuzzy approximations on two universes of discourse ⋮ Quasi-concave functions on meet-semilattices ⋮ A framework for incremental generation of closed itemsets ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ L-concept analysis with positive and negative attributes ⋮ On biconcepts in formal fuzzy concept analysis ⋮ Canonical dichotomous direct bases ⋮ Efficient incremental maintenance for distributive and non-distributive aggregate functions ⋮ Object-oriented interval-set concept lattices ⋮ Ontology-based concept similarity in formal concept analysis ⋮ Link key candidate extraction with relational concept analysis ⋮ On implication bases in \(n\)-lattices ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation ⋮ A closed sets based learning classifier for implicit authentication in web browsing ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs ⋮ A hybrid and exploratory approach to knowledge discovery in metabolomic data ⋮ Approximating concept stability using variance reduction techniques ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts ⋮ Conjunctive query pattern structures: a relational database model for formal concept analysis ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ On the size of \(\exists \)-generalized concept lattices ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns ⋮ Attribute reduction in generalized one-sided formal contexts ⋮ A characterization of the concept of independence in knowledge structures ⋮ The granular partition lattice of an information table ⋮ A methodology for analysis of concept lattice reduction ⋮ Description of sup- and inf-preserving aggregation functions via families of clusters in data tables ⋮ Aggregation on a finite lattice ⋮ Algebras of incidence structures: representations of regular double p-algebras ⋮ Evolution of objects and concepts ⋮ 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 ⋮ Data meaning and knowledge discovery: semantical aspects of information systems ⋮ 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 ⋮ Three-way granular computing, rough sets, and formal concept analysis ⋮ Logic of typical and atypical instances of a concept -- a mathematical model ⋮ Attribute implications in \textbf{L}-concept analysis with positive and negative attributes: validity and properties of models ⋮ Bipolar fuzzy concept learning using next neighbor and Euclidean distance ⋮ Factorization of matrices with grades via essential entries ⋮ A reduction theorem to compute fixpoints of fuzzy closure operators ⋮ On the calculation of formal concept stability ⋮ Lattice-based and topological representations of binary relations with an application to music ⋮ Moore systems and Moore convergence classes of families of nets ⋮ On heterogeneous formal contexts ⋮ On the Galois lattice of bipartite distance hereditary graphs ⋮ Multi-adjoint fuzzy rough sets: definition, properties and attribute selection ⋮ Axiomatic characterizations of dual concept lattices ⋮ Ordinally equivalent data: a measurement-theoretic look at formal concept analysis of fuzzy attributes ⋮ A novel cognitive system model and approach to transformation of information granules ⋮ A categorical representation of algebraic domains based on variations of rough approximable concepts ⋮ The lattice of quasiorder lattices of algebras on a finite set. ⋮ Block relations in formal fuzzy concept analysis ⋮ Formal contexts for algebraic domains ⋮ Triadic fuzzy Galois connections as ordinary connections ⋮ Logical handling of uncertain, ontology-based, spatial information ⋮ Rough approximation operators on two universes of discourse and their fuzzy extensions ⋮ Functional completeness of bounded structures of fuzzy logic with wvt-operators ⋮ Listing closed sets of strongly accessible set systems with applications to data mining ⋮ Relating generalized concept lattices and concept lattices for non-commutative conjunctors ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ A method for automatic construction of ontological knowledge bases. III: Automatic generation of taxonomy as the basis for ontology ⋮ Finite distributive concept algebras ⋮ Generalized Kripke frames ⋮ Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ 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. I. ⋮ Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II. ⋮ On computable automorphisms in formal concept analysis ⋮ Complex concept lattices for simulating human prediction in sport ⋮ A note on blocks of skeleton tolerances. ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ On the order-theoretic properties of lower concept formula systems ⋮ A logic of graded attributes ⋮ Exploring modal worlds ⋮ Inference engine based on closure and join operators over truth table binary relations ⋮ A new algebraic structure for formal concept analysis ⋮ Piecewise-linear approximation of non-linear models based on probabilistically/possibilistically interpreted intervals' numbers (INs) ⋮ Cut approach to islands in rectangular fuzzy relations ⋮ Bases of closure systems over residuated lattices ⋮ Games on concept lattices: Shapley value and core ⋮ A concept approach to input/output logic ⋮ Interactive error correction in implicative theories ⋮ Chu connections and back diagonals between \(\mathcal{Q}\)-distributors ⋮ On the complexity of enumerating pseudo-intents ⋮ Dependence-space-based attribute reduction in consistent decision tables ⋮ On equivalence of conceptual scaling and generalized one-sided concept lattices ⋮ Granularity of attributes in formal concept analysis ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Note on generating fuzzy concept lattices via Galois connections ⋮ Extracting compact and information lossless sets of fuzzy association rules ⋮ On the homomorphism order of labeled posets ⋮ Power contexts and their concept lattices ⋮ Logical analysis of data: classification with justification ⋮ Multi-adjoint property-oriented and object-oriented concept lattices ⋮ Formal context coverage based on isolated labels: an efficient solution for text feature extraction ⋮ On possible generalization of fuzzy concept lattices using dually isomorphic retracts ⋮ EL-shellability and noncrossing partitions associated with well-generated complex reflection groups ⋮ Soft rough approximation operators on a complete atomic Boolean lattice ⋮ The lattice of compatible quasiorders of acyclic monounary algebras ⋮ Distributive envelopes and topological duality for lattices via canonical extensions. ⋮ Canonical extensions of posets. ⋮ A particular Galois connection between relations and set functions. ⋮ Applying relation algebra and RelView to solve problems on orders and lattices ⋮ Connections between covering-based rough sets and concept lattices ⋮ From-below approximations in Boolean matrix factorization: geometry and new algorithm ⋮ A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning ⋮ Formal query systems on contexts and a representation of algebraic lattices ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Dualization in lattices given by ordered sets of irreducibles ⋮ RQL: a query language for rule discovery in databases ⋮ Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ Characterization and reduction of concept lattices through matroid theory ⋮ Bipolar fuzzy graph representation of concept lattice ⋮ On the Dedekind-MacNeille completion and formal concept analysis based on multilattices ⋮ Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges ⋮ Concept analysis via rough set and AFS algebra ⋮ Manifest domains: analysis and description ⋮ Attribute reduction in multi-adjoint concept lattices ⋮ RL-bags: a conceptual, level-based approach to fuzzy bags ⋮ Concept learning via granular computing: a cognitive viewpoint ⋮ The use of two relations in \( L\)-fuzzy contexts ⋮ Generalized one-sided concept lattices with attribute preferences ⋮ Relations of reduction between covering generalized rough sets and concept lattices ⋮ Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory ⋮ Optimal triangular decompositions of matrices with entries from residuated lattices ⋮ An application of formal concept analysis to semantic neural decoding ⋮ Formal concept analysis based on fuzzy granularity base for different granulations ⋮ Embedding mappings and splittings with applications ⋮ Algebras for Galois-style connections and their discrete duality ⋮ Knowledge spaces with graded knowledge states ⋮ Isotone fuzzy Galois connections with hedges ⋮ Extending conceptualisation modes for generalised formal concept analysis ⋮ Valuations and closure operators on finite lattices ⋮ A heuristic knowledge-reduction method for decision formal contexts ⋮ Concept lattices of isotone vs. antitone Galois connections in graded setting: mutual reducibility revisited ⋮ An efficient method to factorize fuzzy attribute-oriented concept lattices ⋮ Very true operators on MTL-algebras ⋮ Discovery of optimal factors in binary data via a novel method of matrix decomposition ⋮ Decision implication canonical basis: a logical perspective ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction ⋮ Note on representing attribute reduction and concepts in concept lattice using graphs ⋮ Characterizing reducts in multi-adjoint concept lattices ⋮ Use of Choquet integrals in multivalued contexts ⋮ On cognitive preferences and the plausibility of rule-based models ⋮ Dynamical duality of type- and token-computation as an abstract brain ⋮ Some useful 16-valued logics: How a computer network should think ⋮ Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Novel fuzzy inference system (FIS) analysis and design based on lattice theory. Part I: Working principles ⋮ Reconstructing concept lattices usingnth-order context kernels ⋮ Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Conceptual Navigation in Large Knowledge Graphs ⋮ FCA2VEC: Embedding Techniques for Formal Concept Analysis ⋮ Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates ⋮ Computing Dependencies Using FCA ⋮ Scalable Visual Analytics in FCA ⋮ Formal Methods in FCA and Big Data ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings ⋮ Mild Continuity Properties of Relations and Relators in Relator Spaces ⋮ Rules acquisition of formal decision contexts based on three-way concept lattices ⋮ Relational Galois connections between transitive digraphs: characterization and construction ⋮ Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ On relationship between three-way concept lattices ⋮ Triads as Modes within Scales as Modes ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ Quantifying the conceptual error in dimensionality reduction ⋮ Attribute selection using contranominal scales ⋮ On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ Visualising lattices with tabular diagrams ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ The structure theorem of three-way concept lattice ⋮ Fuzzy concept lattice reduction using Shannon entropy and Huffman coding ⋮ Axiomatisation of general concept inclusions from finite interpretations ⋮ Three-Way Formal Concept Analysis ⋮ Formal Concepts in Dedekind Categories ⋮ Robot path planning based on concept lattice ⋮ A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts ⋮ Duality for normal lattice expansions and sorted residuated frames with relations ⋮ Unnamed Item ⋮ A machine learning method to reveal closed sets of common features of objects using constraint programming ⋮ The effectiveness of the \(M_{G K}\) measure against the odds ratio in the epidemiological study ⋮ Representation of algebraic domains by formal association rule systems ⋮ Topological representation of double Boolean algebras ⋮ The categorical equivalence between domains and interpolative generalized closure spaces ⋮ Activating Generalized Fuzzy Implications from Galois Connections ⋮ Unnamed Item ⋮ Closures in Binary Partial Algebras ⋮ On Rough Concept Lattices ⋮ Birelator Spaces Are Natural Generalizations of Not Only Bitopological Spaces, But Also Ideal Topological Spaces ⋮ Algebraic Methods for Rough Approximation Spaces by Lattice Interior–Closure Operations ⋮ Irredundant Coverings, Tolerances, and Related Algebras ⋮ Preclusivity and Simple Graphs ⋮ Preclusivity and Simple Graphs: The n–cycle and n–path Cases ⋮ A Knowledge Acquisition Model Based on Formal Concept Analysis in Complex Information Systems ⋮ Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices ⋮ Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices ⋮ Selecting Important Concepts Using Weights ⋮ A Context-Based Description of the Doubly Founded Concept Lattices in the Variety Generated by M 3 ⋮ Biclustering Numerical Data in Formal Concept Analysis ⋮ On Factorization of Concept Lattices by Incompatible Tolerances ⋮ Merging Ordered Sets ⋮ Mining Triadic Association Rules from Ternary Relations ⋮ The Agree Concept Lattice for Multidimensional Database Analysis ⋮ Abstract Concept Lattices ⋮ OnL-fuzzy Chu correspondences ⋮ A decision method based on uncertainty reasoning of linguistic truth-valued concept lattice ⋮ Interval-valued linguistic variables: an application to the L-fuzzy contexts with absent values ⋮ Transformations of Concept Graphs: ⋮ A Set-Theoretical Approach for the Induction of Inheritance Hierarchies ⋮ Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data ⋮ Modeling Ceteris Paribus Preferences in Formal Concept Analysis ⋮ Factorizing three-way binary data ⋮ Central fuzzy sets ⋮ Compressed pseudo-lattices ⋮ Functional and approximate dependency mining: database and FCA points of view ⋮ Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory ⋮ Concept lattice based composite classifiers for high predictability ⋮ ZooM: a nested Galois lattices-based system for conceptual clustering ⋮ Comparing performance of algorithms for generating concept lattices ⋮ A fast incremental algorithm for building lattices ⋮ Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods ⋮ Using Formal Concept Analysis for the Extraction of Groups of Co-expressed Genes ⋮ Join on Closure Systems Using Direct Implicational Basis Representation ⋮ Seriation and matrix reordering methods: An historical overview ⋮ A novel framework for detecting maximally banded matrices in binary data ⋮ Far beyond the classical data models: symbolic data analysis ⋮ CreChainDo: an iterative and interactive Web information retrieval system based on lattices ⋮ Camelis: a logical information system to organise and browse a collection of documents ⋮ Using concept lattices for visual navigation assistance in large databases ⋮ Inducing decision trees via concept lattices1 ⋮ Horn representation of a concept lattice ⋮ A Formal Context for Acyclic Join Dependencies ⋮ On Neural Network Architecture Based on Concept Lattices ⋮ Categories: How I Learned to Stop Worrying and Love Two Sorts ⋮ Factor Space and Normal Context on Concept Description ⋮ Rough Fuzzy Concept Lattice and Its Properties ⋮ The Structure of Multigranular Rough Sets ⋮ Design and comparison of lattices of topological relations for spatial representation and reasoning ⋮ Unnamed Item ⋮ Study of decision implications based on formal concept analysis ⋮ Unnamed Item ⋮ Formal concept analysis with background knowledge: a case study in paleobiological taxonomy of belemnites ⋮ Fuzzy Concept Lattices with Incomplete Knowledge ⋮ Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context ⋮ Quantum Mathematics in Artificial Intelligence ⋮ A computational procedure for variable selection preserving different initial conditions ⋮ The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Maximal and stochastic Galois lattices ⋮ Formal Concept Analysis for general objects. ⋮ Cloud data processing using granular based weighted concept lattice and Hamming distance ⋮ Concept lattices and order in fuzzy logic ⋮ Complexity of learning in concept lattices from positive and negative examples ⋮ A calculus for containment of fuzzy attributes ⋮ Representing a concept lattice by a graph ⋮ Monotone concepts for formal concept analysis ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Basic theorem as representation of heterogeneous concept lattices ⋮ On extending closure systems to matroids ⋮ Convex geometries are extremal for the generalized Sauer-Shelah bound ⋮ Handling noise in Boolean matrix factorization ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ 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 ⋮ The spectra of irreducible matrices over completed idempotent semifields ⋮ Lattice fuzzy transforms from the perspective of mathematical morphology ⋮ Possibility-theoretic extension of derivation operators in formal concept analysis over fuzzy lattices ⋮ To every manifest domain a CSP expression -- a rôle for mereology in computer science ⋮ Binary image 2D shape learning and recognition based on lattice-computing (LC) techniques ⋮ Study of a universal formal context ⋮ Classification based on formal concept analysis and biclustering: possibilities of the approach ⋮ From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory ⋮ Factorization of matrices with grades ⋮ Complete relations on fuzzy complete lattices ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ Basic theorem of fuzzy concept lattices revisited ⋮ Constructing L-fuzzy concept lattices without fuzzy Galois closure operation ⋮ Deciding the word problem in pure double Boolean algebras ⋮ Toward foundations of near sets: (pre-)sheaf theoretic approach ⋮ Representing attribute reduction and concepts in concept lattice using graphs ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Associative models for storing and retrieving concept lattices ⋮ Mining frequent closed rooted trees ⋮ Attribute extended algorithm of lattice-valued concept lattice based on congener formal context ⋮ Three-way concept analysis for incomplete formal contexts ⋮ A context model for fuzzy concept analysis based upon modal logic. ⋮ A formal framework for characterizing querying algorithms. ⋮ Formalizing and enriching phenotype signatures using Boolean networks ⋮ Enumeration of 2-level polytopes ⋮ Sampling frequent and minimal Boolean patterns: theory and application in classification ⋮ A general framework for studying certain generalized topologically open sets in relator spaces ⋮ Note on the characterization and reduction of concept lattices through matroid theory ⋮ A natural Galois connection between generalized norms and metrics ⋮ Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis ⋮ Evolution in time of \(L\)-fuzzy context sequences ⋮ On the connection of hypergraph theory with formal concept analysis and rough set theory ⋮ 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 comparative study of decision implication, concept rule and granular rule ⋮ A fast attribute reduction method for large formal decision contexts ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Probabilistic generalization of formal concepts ⋮ 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices ⋮ Possibility theory and formal concept analysis: characterizing independent sub-contexts ⋮ Sup-t-norm and inf-residuum are one type of relational product: unifying framework and consequences ⋮ Non-dual fuzzy connections ⋮ Observational heterarchy enhancing active coupling ⋮ Pseudo-models and propositional Horn inference ⋮ Closure spaces that are not uniquely generated ⋮ Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors ⋮ Functorial scaling of ordinal data ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ A mathematical analysis of Pāṇini's \textit{Śivasūtras} ⋮ The legacy of 50 years of fuzzy sets: a discussion ⋮ Attribute reduction in intuitionistic fuzzy concept lattices ⋮ Generating a condensed representation for association rules ⋮ Autonomous indefiniteness versus external indefiniteness: Theory of weak topped \(\cap\)-structure and its application to elementary local cellular automaton ⋮ Triangle, parallelogram, and trapezoid orders ⋮ Fuzzy graph representation of a fuzzy concept lattice ⋮ General framework for consistencies in decision contexts ⋮ Rough sets based on Galois connections ⋮ Soft sets combined with fuzzy sets and rough sets: a tentative approach ⋮ Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation ⋮ Multi-adjoint concept lattices via quantaloid-enriched categories ⋮ Compatible attribute subcontexts of one-sided vague formal concept lattices ⋮ On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices ⋮ Methods for identification of spike patterns in massively parallel spike trains ⋮ Exploratory knowledge discovery over web of data ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ A new algorithm for Boolean matrix factorization which admits overcovering ⋮ Locally complete consistent F-augmented contexts: a category-theoretic representation of algebraic L-domains ⋮ On closure operators related to maximal tricliques in tripartite hypergraphs ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ Canonical extensions and relational representations of lattices with negation ⋮ Rough concept lattices and domains ⋮ Attribute reduction in formal contexts based on a new discernibility matrix ⋮ A multi-level conceptual data reduction approach based on the Lukasiewicz implication ⋮ Formal concept analysis via multi-adjoint concept lattices ⋮ A note on the correspondence among entail relations, rough set dependencies, and logical consequence ⋮ Linear measurement models -- axiomatizations and axiomatizability ⋮ Concepts in fuzzy scaling theory: Order and granularity. ⋮ The conceptual weak hierarchy associated with a dissimilarity measure ⋮ The dynamic update method of attribute-induced three-way granular concept in formal contexts ⋮ \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method ⋮ Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis ⋮ Linguistic descriptions of data via fuzzy formal concept analysis ⋮ Rule extraction based on linguistic-valued intuitionistic fuzzy layered concept lattice ⋮ Textural dependency and concept lattices ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Fast algorithms for implication bases and attribute exploration using proper premises ⋮ Biclustering meets triadic concept analysis ⋮ A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs ⋮ Boolean factors as a means of clustering of interestingness measures of association rules ⋮ Attribute reduction theory of concept lattice based on decision formal contexts ⋮ Transformations of discrete closure systems ⋮ On the tolerance lattice of tolerance factors ⋮ Computing semantic clusters by semantic mirroring and spectral graph partitioning ⋮ Impact of Boolean factorization as preprocessing methods for classification of Boolean data ⋮ Factor analysis of ordinal data via decomposition of matrices with grades ⋮ Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation ⋮ Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. ⋮ Application of the \(L\)-fuzzy concept analysis in the morphological image and signal processing ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ Generalized pattern extraction from concept lattices ⋮ A semantic approach to concept lattice-based information retrieval ⋮ On polymorphism-homogeneous relational structures and their clones. ⋮ The categorical equivalence between algebraic domains and F-augmented closure spaces. ⋮ Multi-adjoint t-concept lattices
This page was built for publication:
