Computing triadic generators and association rules from triadic contexts
From MaRDI portal
Recommendations
Cites work
- Biclustering meets triadic concept analysis
- Border algorithms for computing Hasse diagrams of arbitrary lattices.
- Formal concept analysis. Mathematical foundations. Transl. from the German by Cornelia Franzke
- Implications in triadic formal contexts
- Mining triadic association rules from ternary relations
- Pattern discovery in triadic contexts
- The basic theorem of triadic concept analysis
- Towards a navigation paradigm for triadic concepts
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Cited in
(4)
This page was built for publication: Computing triadic generators and association rules from triadic contexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107481)