Pages that link to "Item:Q1904393"
From MaRDI portal
The following pages link to The basic theorem of triadic concept analysis (Q1904393):
Displayed 21 items.
- Triadic fuzzy Galois connections as ordinary connections (Q279379) (← links)
- Triadic concept lattices in the framework of aggregation structures (Q506341) (← links)
- Extending conceptualisation modes for generalised formal concept analysis (Q545323) (← links)
- Some useful 16-valued logics: How a computer network should think (Q815018) (← links)
- Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
- Concept analysis via rough set and AFS algebra (Q955720) (← links)
- On closure operators related to maximal tricliques in tripartite hypergraphs (Q1800387) (← links)
- Computing triadic generators and association rules from triadic contexts (Q2107481) (← links)
- Triadic exploration and exploration with multiple experts (Q2117131) (← links)
- Optimal factorization of three-way binary data using triadic concepts (Q2376908) (← links)
- Dedekind-MacNeille completion of \(n\)-ordered sets (Q2385527) (← links)
- Mining Triadic Association Rules from Ternary Relations (Q3003418) (← links)
- Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context (Q3143401) (← links)
- Triadic concept lattices of data with graded attributes (Q3168395) (← links)
- (Q4508837) (← links)
- Factorizing three-way binary data (Q4932640) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
- Formal Concept Analysis and Extensions for Complex Data Analytics (Q5054972) (← links)
- Towards a Navigation Paradigm for Triadic Concepts (Q5255663) (← links)
- Can triconcepts become triclusters? (Q5326152) (← links)
- Adjunctive three-way concepts from positive and negative concepts in lattice-valued formal contexts (Q6178728) (← links)