E-Books durchsuchen
Formal Concept Analysis [2023]
- 1
-
Approximating Fuzzy Relation Equations Through Concept Lattices
- 2
-
Doubly-Lexical Order Supports Standardisation and Recursive Partitioning of Formal Context
- 3
-
Graph-FCA Meets Pattern Structures
- 4
-
On the Commutative Diagrams Among Galois Connections Involved in Closure Structures
- 5
-
Scaling Dimension
- 6
-
Three Views on Dependency Covers from an FCA Perspective
- 7
-
A Triadic Generalisation of the Boolean Concept Lattice
- 8
-
Computing Witnesses for Centralising Monoids on a Three-Element Set
- 9
-
Description Quivers for Compact Representation of Concept Lattices and Ensembles of Decision Trees
- 10
-
Examples of Clique Closure Systems
- 11
-
On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to <italic>n</italic>=6
- 12
-
Relational Concept Analysis in Practice: Capitalizing on Data Modeling Using Design Patterns
- 13
-
Representing Concept Lattices with Euler Diagrams