Computing triadic generators and association rules from triadic contexts
From MaRDI portal
Publication:2107481
DOI10.1007/S10472-022-09784-4OpenAlexW4210660386MaRDI QIDQ2107481FDOQ2107481
Authors: Rokia Missaoui, Pedro H. B. Ruas, Léonard Kwuida, Mohamed Hamza Ibrahim, Mark A. J. Song
Publication date: 1 December 2022
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-022-09784-4
Recommendations
Cites Work
- Title not available (Why is that?)
- The basic theorem of triadic concept analysis
- Mining triadic association rules from ternary relations
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- Border algorithms for computing Hasse diagrams of arbitrary lattices.
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
- Conceptual Structures at Work
- Biclustering meets triadic concept analysis
- Pattern discovery in triadic contexts
- Towards a Navigation Paradigm for Triadic Concepts
Cited In (2)
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)