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)
06B23: Complete lattices, completions
Related Items
Unnamed Item, Factorizing three-way binary data, Towards a Navigation Paradigm for Triadic Concepts, Can triconcepts become triclusters?, Triadic fuzzy Galois connections as ordinary connections, Extending conceptualisation modes for generalised formal concept analysis, Some useful 16-valued logics: How a computer network should think, Triadic formal concept analysis and triclustering: searching for optimal patterns, Concept analysis via rough set and AFS algebra, Optimal factorization of three-way binary data using triadic concepts, Dedekind-MacNeille completion of \(n\)-ordered sets, Mining Triadic Association Rules from Ternary Relations, Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context, Triadic concept lattices of data with graded attributes
Cites Work