Computing triadic generators and association rules from triadic contexts
From MaRDI portal
Publication:2107481
DOI10.1007/s10472-022-09784-4OpenAlexW4210660386MaRDI QIDQ2107481
Pedro H. B. Ruas, Mohamed Hamza Ibrahim, Rokia Missaoui, Léonard Kwuida, 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
Cites Work
- Unnamed Item
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- The basic theorem of triadic concept analysis
- Pattern discovery in triadic contexts
- Biclustering meets triadic concept analysis
- Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
- Mining Triadic Association Rules from Ternary Relations
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
- Towards a Navigation Paradigm for Triadic Concepts
- Conceptual Structures at Work
This page was built for publication: Computing triadic generators and association rules from triadic contexts