{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:05:45Z","timestamp":1760598345859,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10472-022-09784-4","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T04:40:34Z","timestamp":1643863234000},"page":"1083-1105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing triadic generators and association rules from triadic contexts"],"prefix":"10.1007","volume":"90","author":[{"given":"Rokia","family":"Missaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6423-8681","authenticated-orcid":false,"given":"Pedro H. B.","family":"Ruas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e9onard","family":"Kwuida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark A. J.","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Hamza","family":"Ibrahim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"9784_CR1","unstructured":"Ananias, K.H.A., Missaoui, R., Ruas, P.H.B., Z\u00e1rate, L. E., Song, M.A.J.: Triadic Formal Concept Analysis and triclustering: searching for optimal patterns. Journal of Information Sciences To appear (2021)"},{"key":"9784_CR2","doi-asserted-by":"crossref","unstructured":"Baixeries, J., Szathmary, L., Valtchev, P., Godin, R.: Yet a faster algorithm for building the Hasse diagram of a concept lattice. In: ICFCA\u201909, pp. 162\u2013177 (2009)","DOI":"10.1007\/978-3-642-01815-2_13"},{"key":"9784_CR3","first-page":"49","volume":"6628","author":"JL Balc\u00e1zar","year":"2011","unstructured":"Balc\u00e1zar, J. L., T\u00eerna\u030cuca\u030c, C.: Border algorithms for computing hasse diagrams of arbitrary lattices. LNAI 6628, 49\u201364 (2011)","journal-title":"LNAI"},{"key":"9784_CR4","doi-asserted-by":"crossref","unstructured":"Biedermann, K.: How Triadic Diagrams Represent Conceptual Structures. In: ICCS, pp. 304\u2013317 (1997)","DOI":"10.1007\/BFb0027879"},{"issue":"1","key":"9784_CR5","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.: Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data 3(1), 3:1\u20133:36 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"9784_CR6","doi-asserted-by":"crossref","unstructured":"Ganter, B., Obiedkov, S.A.: Implications in Triadic Formal Contexts. In: ICCS, pp. 186\u2013195 (2004)","DOI":"10.1007\/978-3-540-27769-9_12"},{"key":"9784_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1999). Translator-C. Franzke"},{"issue":"1","key":"9784_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10994-015-5487-y","volume":"101","author":"DI Ignatov","year":"2015","unstructured":"Ignatov, D.I., Gnatyshak, D.V., Kuznetsov, S.O., Mirkin, B.G.: Triadic formal concept analysis and triclustering: searching for optimal patterns. Mach. Learn. 101(1), 271\u2013302 (2015)","journal-title":"Mach. Learn."},{"key":"9784_CR9","doi-asserted-by":"crossref","unstructured":"Jaschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: TRIAS - an algorithm for mining iceberg tri-lattices. In: ICDM\u201906, pp. 907\u2013911 (2006)","DOI":"10.1109\/ICDM.2006.162"},{"issue":"1-2","key":"9784_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10472-013-9379-1","volume":"70","author":"M Kaytoue","year":"2014","unstructured":"Kaytoue, M., Kuznetsov, S.O., Macko, J., Napoli, A.: Biclustering meets triadic concept analysis. Ann. Math. Artif. Intell. 70(1-2), 55\u201379 (2014)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9784_CR11","doi-asserted-by":"crossref","unstructured":"Lehmann, F., Wille, R.: A triadic approach to formal concept analysis. In: ICCS, pp. 32\u201343 (1995)","DOI":"10.1007\/3-540-60161-9_27"},{"key":"9784_CR12","doi-asserted-by":"crossref","unstructured":"Missaoui, R., Kwuida, L.: Mining triadic association rules from ternary relations. In: LNAI, vol. 6628, pp 204\u2013218 (2011)","DOI":"10.1007\/978-3-642-20514-9_16"},{"key":"9784_CR13","doi-asserted-by":"crossref","unstructured":"Missaoui, R., Ruas, P.H.B., Kwuida, L., Song, M.A.J.: Pattern discovery in triadic contexts. In: Alam, M., Braun, T., Yun, B. (eds.) Ontologies and concepts in mind and machine - 25th international conference on conceptual structures, ICCS 2020, Bolzano, Italy, September 18-20, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12277, pp 117\u2013131. Springer (2020)","DOI":"10.1007\/978-3-030-57855-8_9"},{"key":"9784_CR14","unstructured":"Pfaltz, J.L., Taylor, C.M.: Closed Set Mining of Biological Data. In: BIOKDD\u201902, pp. 43\u201348 (2002)"},{"key":"9784_CR15","doi-asserted-by":"crossref","unstructured":"Rudolph, S., Sacarea, C., Troanca, D.: Towards a navigation paradigm for triadic concepts. In: ICFCA\u201915, pp. 252\u2013267 (2015)","DOI":"10.1007\/978-3-319-19545-2_16"},{"issue":"2","key":"9784_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01108624","volume":"12","author":"R Wille","year":"1995","unstructured":"Wille, R.: The basic theorem of triadic concept analysis. Order 12 (2), 149\u2013158 (1995)","journal-title":"Order"},{"key":"9784_CR17","doi-asserted-by":"publisher","unstructured":"Zhao, L., Zaki, M.J.: Tricluster: An effective algorithm for mining coherent clusters in 3d microarray data. In: \u00d6zcan, F. (ed.) Proceedings of the ACM SIGMOD international conference on management of data, Baltimore, Maryland, USA, June 14-16, 2005, pp 694\u2013705. ACM (2005). https:\/\/doi.org\/10.1145\/1066157.1066236","DOI":"10.1145\/1066157.1066236"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09784-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-022-09784-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09784-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T08:17:48Z","timestamp":1669623468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-022-09784-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":17,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["9784"],"URL":"https:\/\/doi.org\/10.1007\/s10472-022-09784-4","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"6 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}