The basic theorem of triadic concept analysis

DOI10.1007/BF01108624zbMath0835.06005MaRDI QIDQ1904393

Rudolf Wille

Publication date: 22 April 1996

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

formal concept analysis; concept lattices; triordered sets; complete trilattices; triadic context

Mathematics Subject Classification ID

06B23: Complete lattices, completions

Related Items

Unnamed Item, Factorizing three-way binary data, Indiscernibility structures induced from function sets : Graph and digraph case, Formal Concept Analysis and Extensions for Complex Data Analytics, Towards a Navigation Paradigm for Triadic Concepts, Can triconcepts become triclusters?, Triadic fuzzy Galois connections as ordinary connections, Triadic concept lattices in the framework of aggregation structures, 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, On closure operators related to maximal tricliques in tripartite hypergraphs, Computing triadic generators and association rules from triadic contexts, Triadic exploration and exploration with multiple experts, 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concept lattices and conceptual knowledge systems
• Coordinatization of ordinal structures