{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:15:02Z","timestamp":1780492502792,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210436","type":"print"},{"value":"9783540246510","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24651-0_30","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:14:05Z","timestamp":1280762045000},"page":"352-371","source":"Crossref","is-referenced-by-count":76,"title":["Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges"],"prefix":"10.1007","author":[{"given":"Petko","family":"Valtchev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rokia","family":"Missaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Godin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), Santiago, Chile, September 1994, pp. 487\u2013499 (1994)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/312129.312252","volume-title":"Proceedings, KDD 1999","author":"N. Ayan","year":"1999","unstructured":"Ayan, N., Tansel, A., Arkun, M.: An efficient algorithm to update large itemsets with early pruning. In: Proceedings, KDD 1999, San Diego,CA, USA, pp. 287\u2013291. ACM Press, New York (1999)"},{"key":"30_CR3","unstructured":"Barbut, M., Monjardet, B.: Ordre et Classification: Alg\u00e8bre et combinatoire. Hachette (1970)"},{"key":"30_CR4","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. AMS Colloquium Publications, vol.\u00a0XXV. AMS (1967)"},{"key":"30_CR5","first-page":"31","volume":"96","author":"J.-P. Bordat","year":"1986","unstructured":"Bordat, J.-P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math\u00e9matiques et Sciences Humaines\u00a096, 31\u201347 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Han, J., Ng, V., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Proceedings, ICDE 1996, New Orleans, LA, USA, pp. 106\u2013114 (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"30_CR7","volume-title":"Introduction to lattices and order","author":"B.A. Davey","year":"1992","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to lattices and order. Cambridge University Press, Cambridge (1992)"},{"key":"30_CR8","unstructured":"Feldman, R., Aumann, Y., Amir, A., Mannila, H.: Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. In: Proceedings, ACM SIGMOD Workshop DMKD 1997, Tucson, AZ, USA, pp. 59\u201370 (1997)"},{"key":"30_CR9","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. preprint 831, Technische Hochschule, Darmstadt (1984)"},{"key":"30_CR10","doi-asserted-by":"crossref","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, Heidelberg (1999)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0304-3975(94)90195-3","volume":"133","author":"R. Godin","year":"1994","unstructured":"Godin, R., Missaoui, R.: An Incremental Concept Formation Approach for Learning from Databases. Theoretical Computer Science\u00a0133, 378\u2013419 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R. Godin","year":"1995","unstructured":"Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence\u00a011(2), 246\u2013267 (1995)","journal-title":"Computational Intelligence"},{"key":"30_CR13","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 Sociales\u00a095, 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Sociales"},{"key":"30_CR14","volume-title":"Data Mining : Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Concise representations of association rules. In: Pattern Detection and Discovery, pp. 92\u2013109 (2002)","DOI":"10.1007\/3-540-45728-3_8"},{"issue":"2-3","key":"30_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S., Ob\u2019edkov, S.: Comparing the performance of algorithms for generating concept lattices. Journal of Experimental & Theoretical Artificial Intelligence\u00a014(2-3), 189\u2013216 (2002)","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"issue":"113","key":"30_CR17","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"Luxenburger, M.: Implications partielles dans un contexte. Math\u00e9matiques et Sciences Humaines\u00a029(113), 35\u201355 (1991)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"30_CR18","volume-title":"The theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"Maier, D.: The theory of Relational Databases. Computer Science Press, Rockville (1983)"},{"key":"30_CR19","first-page":"181","volume-title":"Proceedings, AAAIWorkshop on Knowledge Discovery in Databases","author":"H. Mannila","year":"1994","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.: Efficient algorithms for discovering association rules. In: Fayyad, U., Uthurusamy, R. (eds.) Proceedings, AAAIWorkshop on Knowledge Discovery in Databases, Seattle, WA, USA, pp. 181\u2013192. AAAI Press, Menlo Park (1994)"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L. Nourine","year":"1999","unstructured":"Nourine, L., Raynaud, O.: A Fast Algorithm for Building Lattices. Information Processing Letters\u00a071, 199\u2013204 (1999)","journal-title":"Information Processing Letters"},{"key":"30_CR21","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1090\/S0002-9947-1944-0010555-7","volume":"55","author":"O. O\"re","year":"1944","unstructured":"O\"re, O.: Galois connections. Transactions of the American Mathematical Society\u00a055, 493\u2013513 (1944)","journal-title":"Transactions of the American Mathematical Society"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Pan, F., Cong, G., Tung, A., Yang, J., Zaki, M.: Carpenter: Finding closed patterns in long biological datasets. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC (August 2003)","DOI":"10.1145\/956750.956832"},{"key":"30_CR23","unstructured":"Pasquier, N.: Extraction de bases pour les r\u00e8gles d\u2019association \u00e0 partir des itemsets ferm\u00e9s fr\u00e9quents. In: Proceedings of the 18th INFORSID 2000, Lyon, France, pp. 56\u201377 (2000)"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings, ICDT 1999, Jerusalem, Israel, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"30_CR25","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":"30_CR26","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proceedings, ACM SIGMOD Workshop DMK 20\u201900, Dallas, TX, USA, pp. 21\u201330 (2000)"},{"key":"30_CR27","unstructured":"Pfaltz, J., Taylor, C.: Scientific discovery through iterative transformations of concept lattices. In: Proceedings of the 1st International Workshop on Discrete Mathematics and Data Mining, Washington, DC, USA, April 2002, pp. 65\u201374 (2002)"},{"issue":"2","key":"30_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing Iceberg Concept Lattices with Titanic. Data and Knowledge Engineering\u00a042(2), 189\u2013222 (2002)","journal-title":"Data and Knowledge Engineering"},{"key":"30_CR29","unstructured":"Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In: Proceedings, KDD 19 New Port Beach, CA, USA, pp. 263\u2013266 (1997)"},{"key":"30_CR30","unstructured":"Valtchev, P., Duquenne, V.: Towards scalable divide-and-conquer methods for computing concepts and implications. In: SanJuan, E., Berry, A., Sigayret, A., Napoli, A. (eds.) Proceedings of the 4th Intl. Conference Journ\u00e9es de l\u2019Informatique Messine (JIM 2003): Knowledge Discovery and Discrete Mathematics, Metz (FR), September 3-6, pp. 3\u201315. INRIA (2003)"},{"key":"30_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-45091-7_20","volume-title":"Conceptual Structures for Knowledge Creation and Communication","author":"P. Valtchev","year":"2003","unstructured":"Valtchev, P., Rouane Hacene, M., Missaoui, R.: A generic scheme for the design of efficient on-line algorithms for lattices. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS, vol.\u00a02746, pp. 282\u2013295. Springer, Heidelberg (2003)"},{"key":"30_CR32","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":"2-3","key":"30_CR33","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/09528130210164198","volume":"14","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. Journal of Experimental & Theoretical Artificial Intelligence\u00a014(2-3), 115\u2013142 (2002)","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"issue":"3","key":"30_CR34","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"},{"key":"30_CR35","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC, USA (2003)","DOI":"10.1145\/956750.956779"},{"key":"30_CR36","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"issue":"2-3","key":"30_CR37","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/09528130210164161","volume":"14","author":"R. Wille","year":"2002","unstructured":"Wille, R.: Why can concept lattices support knowledge discovery in databases. Journal of Experimental & Theoretical Artificial Intelligence\u00a014(2-3), 81\u201392 (2002)","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"key":"30_CR38","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: Mining Closed Frequent Graph Patterns. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC (2003)","DOI":"10.1137\/1.9781611972733.15"},{"key":"30_CR39","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Datasets. In: Grossman, R., Han, J., Kumar, V., Mannila, H., Motwani, R. (eds.) Proceedings of the 3rd SIAM International Conference on Data Mining (ICDM 2003), San Fransisco, CA (2003)","DOI":"10.1137\/1.9781611972733.15"},{"issue":"4","key":"30_CR40","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M.J. Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. IEEE Concurency\u00a07(4), 14\u201325 (1999)","journal-title":"IEEE Concurency"},{"key":"30_CR41","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating Non-Redundant Association Rules. In: Proceedings, KDD 2000, Boston, MA, USA, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"30_CR42","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An Efficiently Algorithm for Closed Itemset Mining. In: Grossman, R., Han, J., Kumar, V., Mannila, H., Motwani, R. (eds.) Proceedings of the 2nd SIAM International Conference on Data Mining, ICDM 2002 (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Concept Lattices"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24651-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T17:28:38Z","timestamp":1552843718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24651-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210436","9783540246510"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24651-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}