The following pages link to Formal Concept Analysis (Q2907455):
Displayed 50 items.
- Two Basic Algorithms in Concept Analysis (Q3552300) (← links)
- Performances of Galois Sub-hierarchy-building Algorithms (Q3590977) (← links)
- A Parameterized Algorithm for Exploring Concept Lattices (Q3590978) (← links)
- Base Points, Non-unit Implications, and Convex Geometries (Q3590979) (← links)
- Relational Galois Connections (Q3590980) (← links)
- On the MacNeille Completion of Weakly Dicomplemented Lattices (Q3590981) (← links)
- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data (Q3590983) (← links)
- Some Notes on Pseudo-closed Sets (Q3590984) (← links)
- The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees (Q3590985) (← links)
- On Multi-adjoint Concept Lattices: Definition and Representation Theorem (Q3590986) (← links)
- A Solution of the Word Problem for Free Double Boolean Algebras (Q3590988) (← links)
- The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices (Q3590989) (← links)
- A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets (Q3590991) (← links)
- Galois Connections Between Semimodules and Applications in Data Mining (Q3590992) (← links)
- About the Lossless Reduction of the Minimal Generator Family of a Context (Q3590993) (← links)
- Lattices of Relatively Axiomatizable Classes (Q3590994) (← links)
- Polynomial Embeddings and Representations (Q3590995) (← links)
- Semantology as Basis for Conceptual Knowledge Processing (Q3590996) (← links)
- Bipartite Ferrers-Graphs and Planar Concept Lattices (Q3590997) (← links)
- Computing Intensions of Digital Library Collections (Q3590998) (← links)
- Usability Issues in Description Logic Knowledge Base Completion (Q3630233) (← links)
- Concept Lattice Orbifolds – First Steps (Q3630234) (← links)
- The Advent of Formal Diagrammatic Reasoning Systems (Q3630235) (← links)
- Time and Logic: A.N. Prior’s Formal Analysis of Temporal Concepts (Q3630236) (← links)
- Factor Analysis of Incidence Data via Novel Decomposition of Matrices (Q3630237) (← links)
- A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules (Q3630238) (← links)
- Robust Elements in Rough Set Abstractions (Q3630239) (← links)
- Some Computational Problems Related to Pseudo-intents (Q3630240) (← links)
- Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$ (Q3630241) (← links)
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice (Q3630242) (← links)
- Context Graphs — Representing Formal Concepts by Connected Subgraphs (Q3630243) (← links)
- Handling Large Formal Context Using BDD – Perspectives and Limitations (Q3630244) (← links)
- A Novel Approach to Cell Formation (Q3630246) (← links)
- Two FCA-Based Methods for Mining Gene Expression Data (Q3630247) (← links)
- RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS (Q3630248) (← links)
- Contextual Implications between Attributes and Some Representation Properties for Finite Lattices (Q4924382) (← links)
- Mathematical Morphology Operators over Concept Lattices (Q4924383) (← links)
- Dismantlable Lattices in the Mirror (Q4924384) (← links)
- Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis (Q4924385) (← links)
- Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data (Q4924387) (← links)
- Formal Concept Analysis via Atomic Priming (Q4924388) (← links)
- Applications of Ordinal Factor Analysis (Q4924389) (← links)
- Tri-ordinal Factor Analysis (Q4924390) (← links)
- Formal $\mathcal{F}$ -contexts and Their Induced Implication Rule Systems (Q4924391) (← links)
- User-Friendly Fuzzy FCA (Q4924392) (← links)
- Proper Mergings of Stars and Chains Are Counted by Sums of Antidiagonals in Certain Convolution Arrays (Q4924393) (← links)
- Modeling Ceteris Paribus Preferences in Formal Concept Analysis (Q4924394) (← links)
- Concept-Forming Operators on Multilattices (Q4924395) (← links)
- Soundness and Completeness of Relational Concept Analysis (Q4924396) (← links)
- Contextual Uniformities (Q4924397) (← links)