| Enumerating Maximal Consistent Closed Sets in Closure Systems
|
2021 |
Nouri, Lhouari |
| Boolean Substructures in Formal Concept Analysis
|
2021 |
Koyda, Maren |
| Visualization of Statistical Information in Concept Lattice Diagrams
|
2021 |
Klimpke, Jana |
| Force-Directed Layout of Order Diagrams Using Dimensional Reduction
|
2021 |
Dürrschnabel, Dominik |
| Filters, Ideals and Congruences on Double Boolean Algebras
|
2021 |
Lea, Tenkeu Jeufack Yannick |
| Sandwich: An Algorithm for Discovering Relevant Link Keys in an Concept Lattice
|
2021 |
Abbas, Nacira |
| Decision Concept Lattice vs. Decision Trees and Random Forests
|
2021 |
Dudyrev, Egor |
| Diagrammatic Representation of Conceptual Structures
|
2021 |
Priss, Uta |
| Representing Partition Lattices Through FCA
|
2021 |
Behrisch, Mike |
| Approximate Computation of Exact Association Rules
|
2021 |
Bansal, Saurabh |
| Clustering and Identification of Core Implications.
|
2021 |
López-Rodriguez, Domingo |
| Towards Interactive Transition from AOC Poset to Concept Lattice
|
2021 |
Pattison, Tim |
| Pruning Techniques in LinCbO for Computation J of the Duquenne-Guigues Basis
|
2021 |
Janostik, Radek |
| Extracting Relations in Texts with Concepts of Neighbours
|
2021 |
Ayats, Hugo |
| Triadic Exploration and Exploration with Multiple Experts
|
2021 |
Felde, Maximilian |
| Fixed-Point Semantics for Barebone Relational Concept Analysis
|
2021 |
Euzenat, Jérôme |
| A New Kind of Implication to Reason with Unknown Information
|
2021 |
Pérez-Gámez, Francisco |
| An Incremental Recomputation of From-Below Boolean Matrix Factorization
|
2021 |
Trnecka, Martin |
| Exploring Scale-Measures of Data Sets
|
2021 |
Hanika, Tom |
Tag hinzufügen