The basic theorem of triadic concept analysis
From MaRDI portal
Publication:1904393
DOI10.1007/BF01108624zbMath0835.06005MaRDI QIDQ1904393
Publication date: 22 April 1996
Published in: Order (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (22)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Triadic fuzzy Galois connections as ordinary connections ⋮ Triadic concept lattices of data with graded attributes ⋮ Optimal factorization of three-way binary data using triadic concepts ⋮ Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Dedekind-MacNeille completion of \(n\)-ordered sets ⋮ Can triconcepts become triclusters? ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Triadic concept approximation ⋮ Adjunctive three-way concepts from positive and negative concepts in lattice-valued formal contexts ⋮ Unnamed Item ⋮ Mining Triadic Association Rules from Ternary Relations ⋮ Triadic concept lattices in the framework of aggregation structures ⋮ Concept analysis via rough set and AFS algebra ⋮ Extending conceptualisation modes for generalised formal concept analysis ⋮ Factorizing three-way binary data ⋮ On closure operators related to maximal tricliques in tripartite hypergraphs ⋮ Towards a Navigation Paradigm for Triadic Concepts ⋮ Computing triadic generators and association rules from triadic contexts ⋮ Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context ⋮ Some useful 16-valued logics: How a computer network should think ⋮ Triadic exploration and exploration with multiple experts
Cites Work
This page was built for publication: The basic theorem of triadic concept analysis
