{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:50:49Z","timestamp":1761947449104},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423447"},{"type":"electronic","value":"9783540445838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44583-8_21","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:22:18Z","timestamp":1187238138000},"page":"290-303","source":"Crossref","is-referenced-by-count":30,"title":["Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods"],"prefix":"10.1007","author":[{"given":"Petko","family":"Valtchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rokia","family":"Missaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,12]]},"reference":[{"unstructured":"M. Barbut and B. Monjardet. Ordre et Classification: Alg\u00e9bre et combinatoire. Hachette, 1970.","key":"21_CR1"},{"key":"21_CR2","first-page":"31","volume":"96","author":"J.-P. Bordat","year":"1986","unstructured":"J.-P. Bordat. Calcul pratique du treillis de Galois d\u2019une correspondance. Math\u00e9matiques et Sciences Humaines, 96:31\u201347, 1986.","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"unstructured":"B. A. Davey and H. A. Priestley. Introduction to lattices and order. Cambridge University Press, 1992.","key":"21_CR3"},{"doi-asserted-by":"crossref","unstructured":"B. Ganter and S. Kuznetsov. Stepwise Construction of the Dedekind-McNeille Completion. In Proceedings of the 6th ICCS, pages 295\u2013302, Montpellier, 1998.","key":"21_CR4","DOI":"10.1007\/BFb0054922"},{"doi-asserted-by":"crossref","unstructured":"B. Ganter and R. Wille. Formal Concept Analysis, Mathematical Foundations. Springer-Verlag, 1999.","key":"21_CR5","DOI":"10.1007\/978-3-642-59830-2"},{"doi-asserted-by":"crossref","unstructured":"R. Godin and H. Mili. Building and maintaining analysis-level class hierarchies using Galois lattices. In Proceedings of OOPSLA\u2019 93, Washington (DC), USA, special issue of ACM SIGPLAN Notices, 28(10), pages 394\u2013410, 1993.","key":"21_CR6","DOI":"10.1145\/165854.165931"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0304-3975(94)90195-3","volume":"133","author":"R. Godin","year":"1994","unstructured":"R. Godin and R. Missaoui. An Incremental Concept Formation Approach for Learning from Databases. Theoretical Computer Science, 133:378\u2013419, 1994.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R. Godin","year":"1995","unstructured":"R. Godin, R. Missaoui, and H. Alaoui. Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence, 11(2):246\u2013267, 1995.","journal-title":"Computational Intelligence"},{"key":"21_CR9","volume-title":"MATH-AL-05-2000","author":"S. Kuznetsov","year":"2000","unstructured":"S. Kuznetsov and S. Objedkov. Algorithms for the Construction of the Set of All Concept and Their Line Diagram. preprint MATH-AL-05-2000, Technische Universit\u00e4t, Dresden, June 2000."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L. Nourine","year":"1999","unstructured":"L. Nourine and O. Raynaud. A Fast Algorithm for Building Lattices. Information Processing Letters, 71:199\u2013204, 1999.","journal-title":"Information Processing Letters"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, T. Taouil, and L. Lakhal. Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems, 24(1):25\u201346, 1999.","journal-title":"Information Systems"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1111\/0824-7935.00082","volume":"15","author":"P. Valtchev","year":"1999","unstructured":"P. Valtchev. An algorithm for minimal insertion in a type lattice. Computational Intelligence, 15(1):63\u201378, 1999.","journal-title":"Computational Intelligence"},{"doi-asserted-by":"crossref","unstructured":"P. Valtchev, R. Missaoui, and P. Lebrun. A partition-based approach towards building Galois (concept) lattices. to appear in Discrete Mathematics, 2001.","key":"21_CR13","DOI":"10.1016\/S0012-365X(02)00349-7"},{"doi-asserted-by":"crossref","unstructured":"R. Wille. Restructuring the lattice theory: An approach based on hierarchies of concepts. In I. Rival, editor, Ordered sets, pages 445\u2013470, Dordrecht-Boston, 1982. Reidel.","key":"21_CR14","DOI":"10.1007\/978-94-009-7798-3_15"}],"container-title":["Lecture Notes in Computer Science","Conceptual Structures: Broadening the Base"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44583-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:16:31Z","timestamp":1556756191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44583-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423447","9783540445838"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44583-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}