E-Books durchsuchen
Formal Concept Analysis [2021]
- 1
-
Formal Concept Analysis and Extensions for Complex Data Analytics
- 1
-
Representing Partition Lattices Through FCA
- 2
-
Conceptual Navigation in Large Knowledge Graphs
- 2
-
Fixed-Point Semantics for Barebone Relational Concept Analysis
- 3
-
Boolean Substructures in Formal Concept Analysis
- 3
-
FCA2VEC: Embedding Techniques for Formal Concept Analysis
- 4
-
Enumerating Maximal Consistent Closed Sets in Closure Systems
- 4
-
Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
- 5
-
A New Kind of Implication to Reason with Unknown Information
- 5
-
Dealing with Large Volumes of Complex Relational Data Using RCA
- 6
-
Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis
- 6
-
Computing Dependencies Using FCA
- 7
-
Approximate Computation of Exact Association Rules
- 7
-
Leveraging Closed Patterns and Formal Concept Analysis for Enhanced Microblogs Retrieval
- 8
-
An Incremental Recomputation of From-Below Boolean Matrix Factorization
- 8
-
Scalable Visual Analytics in FCA
- 9
-
Clustering and Identification of Core Implications
- 9
-
Formal Methods in FCA and Big Data
- 10
-
Extracting Relations in Texts with Concepts of Neighbours
- 10
-
Towards Distributivity in FCA for Phylogenetic Data
- 11
-
Triadic Exploration and Exploration with Multiple Experts
- 11
-
Triclustering in Big Data Setting
- 12
-
Towards Interactive Transition from AOC Poset to Concept Lattice
- 13
-
Visualization of Statistical Information in Concept Lattice Diagrams
- 14
-
Force-Directed Layout of Order Diagrams Using Dimensional Reduction
- 15
-
Sandwich: An Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice
- 16
-
Decision Concept Lattice vs. Decision Trees and Random Forests
- 17
-
Exploring Scale-Measures of Data Sets
- 18
-
Filters, Ideals and Congruences on Double Boolean Algebras
- 19
-
Diagrammatic Representation of Conceptual Structures