{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T01:28:44Z","timestamp":1785029324146,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642205132","type":"print"},{"value":"9783642205149","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20514-9_16","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T05:28:16Z","timestamp":1303882096000},"page":"204-218","source":"Crossref","is-referenced-by-count":21,"title":["Mining Triadic Association Rules from Ternary Relations"],"prefix":"10.1007","author":[{"given":"Rokia","family":"Missaoui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L\u00e9onard","family":"Kwuida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-01815-2_13","volume-title":"Formal Concept Analysis","author":"J. Baixeries","year":"2009","unstructured":"Baixeries, J., Szathmary, L., Valtchev, P., Godin, R.: Yet a faster algorithm for building the hasse diagram of a concept lattice. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS, vol.\u00a05548, pp. 162\u2013177. Springer, Heidelberg (2009)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Biedermann, K.: How triadic diagrams represent conceptual structures. In: ICCS 1997, pp. 304\u2013317 (1997)","DOI":"10.1007\/BFb0027879"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.-F.: Closed patterns meet -ary relations. TKDD\u00a03(1) (2009)","DOI":"10.1145\/1497577.1497580"},{"key":"16_CR5","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":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer-Verlag New York, Inc., Heidelberg (1999) (Translator-C. Franzke)","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"1","key":"16_CR7","first-page":"5","volume":"95","author":"J.-L. Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines\u00a095(1), 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"16_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-70901-5_9","volume-title":"Formal Concept Analysis","author":"T. Hamrouni","year":"2007","unstructured":"Hamrouni, T., Valtchev, P., Yahia, S.B., Nguifo, E.M.: About the lossless reduction of the minimal generator family of a context. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol.\u00a04390, pp. 130\u2013150. Springer, Heidelberg (2007)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"J\u00e4schke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Trias - an algorithm for mining iceberg tri-lattices. In: ICDM, pp. 907\u2013911 (2006)","DOI":"10.1109\/ICDM.2006.162"},{"key":"16_CR10","unstructured":"Ji, L., Tan, K.-L., Tung, A.K.H.: Mining frequent closed cubes in 3d datasets. In: VLDB, pp. 811\u2013822 (2006)"},{"key":"16_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-47887-6_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M., Gajek, M.: Concise representation of frequent patterns based on generalized disjunction-free generators. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"16_CR12","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"},{"issue":"113","key":"16_CR13","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"Luxenburger, M.: Implications partielles dans un contexte. Math\u00e9matiques, Informatique et Sciences Humaines\u00a029(113), 35\u201355 (1991)","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"key":"16_CR14","unstructured":"Nguyen, K.N.T., Cerf, L., Plantevit, M., Boulicaut, J.-F.: Discovering inter-dimensional rules in dynamic graphs. In: Proc. Workshop on Dynamic Networks and Knowledge Discovery DYNAK 2010 co-located with ECML\/PKDD 2010, Barcelona, pp. 5\u201316 (2010)"},{"issue":"2-3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/09528130210164152","volume":"14","author":"L. Nourine","year":"2002","unstructured":"Nourine, L., Raynaud, O.: A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell.\u00a014(2-3), 217\u2013227 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, T., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"16_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-88411-8_15","volume-title":"Discovery Science","author":"L. Szathmary","year":"2008","unstructured":"Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Constructing iceberg lattices from frequent closures using generators. In: Boulicaut, J.-F., Berthold, M.R., Horv\u00e1th, T. (eds.) DS 2008. LNCS (LNAI), vol.\u00a05255, pp. 136\u2013147. Springer, Heidelberg (2008)"},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1021252203599","volume":"19","author":"G. Voutsadakis","year":"2002","unstructured":"Voutsadakis, G.: Polyadic concept analysis. Order\u00a019(3), 295\u2013304 (2002)","journal-title":"Order"},{"issue":"2","key":"16_CR19","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\u00a012(2), 149\u2013158 (1995)","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20514-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T07:52:30Z","timestamp":1637567550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20514-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205132","9783642205149"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20514-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}