Funder
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference17 articles.
1. Ananias, K.H.A., Missaoui, R., Ruas, P.H.B., Zárate, L. E., Song, M.A.J.: Triadic Formal Concept Analysis and triclustering: searching for optimal patterns. Journal of Information Sciences To appear (2021)
2. Baixeries, J., Szathmary, L., Valtchev, P., Godin, R.: Yet a faster algorithm for building the Hasse diagram of a concept lattice. In: ICFCA’09, pp. 162–177 (2009)
3. Balcázar, J. L., Tîrnǎucǎ, C.: Border algorithms for computing hasse diagrams of arbitrary lattices. LNAI 6628, 49–64 (2011)
4. Biedermann, K.: How Triadic Diagrams Represent Conceptual Structures. In: ICCS, pp. 304–317 (1997)
5. Cerf, L., Besson, J., Robardet, C., Boulicaut, J.: Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data 3(1), 3:1–3:36 (2009)