{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T18:27:22Z","timestamp":1779301642750,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153891","type":"print"},{"value":"9783642153907","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15390-7_36","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T04:14:41Z","timestamp":1283487281000},"page":"351-360","source":"Crossref","is-referenced-by-count":6,"title":["Incremental Construction of Alpha Lattices and Association Rules"],"prefix":"10.1007","author":[{"given":"Henry","family":"Soldano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Ventos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Champesme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Forge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-68125-0_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Arimura","year":"2008","unstructured":"Arimura, H.: Efficient algorithms for mining frequent and closed patterns from semi-structured data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 2\u201313. Springer, Heidelberg (2008)"},{"key":"36_CR2","unstructured":"Barbu, M., Montjardet, M.: Ordre et Classification, Alg\u00e8bre et Combinatoire 2. Hachette Universit\u00e9 (1970)"},{"key":"36_CR3","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1973","unstructured":"Birkhoff, G.: Lattice Theory. American Mathematical Society Colloquium Publications, Rhode Island (1973)"},{"key":"36_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Logical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Logical Foundations. Springer, Heidelberg (1999)"},{"key":"36_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44583-8_10","volume-title":"Conceptual Structures: Broadening the Base","author":"B. Ganter","year":"2001","unstructured":"Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol.\u00a02120, pp. 129\u2013142. Springer, Heidelberg (2001)"},{"key":"36_CR6","first-page":"485","volume-title":"ECAI","author":"D. Janetzko","year":"2004","unstructured":"Janetzko, D., Cherfi, H., Kennke, R., Napoli, A., Toussaint, Y.: Knowledge-based selection of association rules for text mining. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI, pp. 485\u2013489. IOS Press, Amsterdam (2004)"},{"key":"36_CR7","volume-title":"ICML 1998","author":"M. Liquiere","year":"1998","unstructured":"Liquiere, M., Sallantin, J.: Structural machine learning with Galois lattice and graphs. In: ICML 1998. Morgan Kaufmann, San Francisco (1998)"},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Journal Intelligent Information Systems (JIIS)\u00a024(1), 29\u201360 (2005)","journal-title":"Journal Intelligent Information Systems (JIIS)"},{"issue":"14","key":"36_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/09528130210164189","volume":"2\/3","author":"N. Pernelle","year":"2002","unstructured":"Pernelle, N., Rousset, M.-C., Soldano, H., Ventos, V.: Zoom: a nested Galois lattices-based system for conceptual clustering. J. of Experimental and Theoretical Artificial Intelligence\u00a02\/3(14), 157\u2013187 (2002)","journal-title":"J. of Experimental and Theoretical Artificial Intelligence"},{"key":"36_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45422-5_24","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"G. Stumme","year":"2001","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol.\u00a02174, pp. 335\u2013349. Springer, Heidelberg (2001)"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2007.190695","volume":"20","author":"A. Termier","year":"2008","unstructured":"Termier, A., Rousset, M.-C., Sebag, M., Ohara, K., Washio, T., Motoda, H.: Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. Knowl. Data Eng.\u00a020(3), 300\u2013320 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. Discovery Science, 16\u201331 (2004)","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"36_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-44583-8_21","volume-title":"Conceptual Structures: Broadening the Base","author":"P. Valtchev","year":"2001","unstructured":"Valtchev, P., Missaoui, R.: Building concept (Galois) lattices from parts: generalizing the incremental methods. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol.\u00a02120, pp. 290\u2013303. Springer, Heidelberg (2001)"},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0012-365X(02)00349-7","volume":"256","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics\u00a0256(3), 801\u2013829 (2002)","journal-title":"Discrete Mathematics"},{"issue":"14","key":"36_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/09528130210164198","volume":"2\/3","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Godin, R., Meridji, M.: Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory. J. of Experimental and Theoretical Artificial Intelligence\u00a02\/3(14), 115\u2013142 (2002)","journal-title":"J. of Experimental and Theoretical Artificial Intelligence"},{"key":"36_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-540-32262-7_21","volume-title":"Formal Concept Analysis","author":"V. Ventos","year":"2005","unstructured":"Ventos, V., Soldano, H.: Alpha galois lattices: An overview. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 299\u2013314. Springer, Heidelberg (2005)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: Intl. Conf. on Knowledge Discovery and DataMining, KDD 2000 (2000)","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15390-7_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:06:38Z","timestamp":1606169198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15390-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153891","9783642153907"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15390-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}