Computing triadic generators and association rules from triadic contexts

In this paper, we present a set of algorithms to display a Hasse diagram of triadic concepts in Triadic Concept Analysis and compute triadic generators and association rules, including implications without any need for a preprocessing step to convert the triadic representation into a dyadic one. Our contributions are as follows. First, we adapt the iPred algorithm for precedence link computation in concept lattices to the triadic framework. Then, new algorithms are proposed to compute triadic generators by extending the notion of faces to further calculate association rules. Finally, an empirical study is conducted in order to mainly show the performance of our prototype on triadic contexts and estimate the cost of each one of its components.