Polyadic concept analysis

DOI10.1023/A:1021252203599zbMath1013.06006OpenAlexW1575920186MaRDI QIDQ1863075

George Voutsadakis

Publication date: 11 March 2003

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021252203599

zbMATH Keywords

complete latticesformal concept analysisformal contextstriadic concept analysistriordered sets

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Lattices (06B99)

Related Items (16)

Triadic fuzzy Galois connections as ordinary connections ⋮ Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Dedekind-MacNeille completion of \(n\)-ordered sets ⋮ Can triconcepts become triclusters? ⋮ Triclusters of close values for the analysis of 3D data ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Graph-FCA meets pattern structures ⋮ A triadic generalisation of the Boolean concept lattice ⋮ Mining Triadic Association Rules from Ternary Relations ⋮ Biclustering meets triadic concept analysis ⋮ On implication bases in \(n\)-lattices ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs ⋮ On closure operators related to maximal tricliques in tripartite hypergraphs ⋮ Interesting pattern mining in multi-relational data ⋮ Steps towards causal Formal Concept Analysis ⋮ Some useful 16-valued logics: How a computer network should think

This page was built for publication: Polyadic concept analysis