{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T14:52:38Z","timestamp":1780066358637,"version":"3.54.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T00:00:00Z","timestamp":1181260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2007,8,2]]},"DOI":"10.1007\/s10472-007-9063-4","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T07:44:35Z","timestamp":1181202275000},"page":"117-136","source":"Crossref","is-referenced-by-count":19,"title":["A local approach to concept generation"],"prefix":"10.1007","volume":"49","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Paul","family":"Bordat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,6,8]]},"reference":[{"key":"9063_CR1","unstructured":"Barbut, M., Monjardet, B.: Ordre et classification. In: Classiques Hachette (1970)"},{"key":"9063_CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1142\/S0129054100000211","volume":"11","author":"A. Berry","year":"2000","unstructured":"Berry, A., Bordat, J-P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Found. Comput. Sci. 11, 397\u2013404 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9063_CR3","doi-asserted-by":"crossref","unstructured":"Berry, A., Sigayret, A.: Representing a concept lattice by a graph. In: Proceedings of DM&DM\u201902 (Discrete Maths and Data Mining Workshop), 2nd SIAM Conference on Data Mining (Arlington, VA, April 2002). Discrete Applied Mathematics, special issue on Discrete Maths and Data Mining 144(1\u20132), 27\u201342 (2004)","DOI":"10.1016\/j.dam.2004.02.016"},{"key":"9063_CR4","doi-asserted-by":"crossref","unstructured":"Berry, A., Sigayret, A.: Maintaining class membership information. In: Workshop MASPEGHI (MAnaging of SPEcialization\/Generalization HIerarchies), LNCS proceedings of OOIS\u201902 (Object-Oriented Information Systems) Montpellier, France (2002)","DOI":"10.1007\/3-540-46105-1_3"},{"key":"9063_CR5","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory (3rd edn.). American Mathematical Society, Providence, RI (1967)","edition":"3"},{"key":"9063_CR6","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. Inform. Sci. Hum. 96, 31\u201347 (1986)","journal-title":"Math. Inform. Sci. Hum."},{"key":"9063_CR7","unstructured":"Chein, M.: Algorithme de recherche de sous-matrices premi\u00e8res d\u2019une matrice. Bull. Math. Soc. Sci. R\u00e9pub. Social. Roum. 13 (1969)"},{"issue":"3","key":"9063_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"9063_CR9","first-page":"537","volume-title":"Proceedings of ICTAI\u201903 (15th IEEE International Conference on Tools with Artificial Intelligence), Sacramento, CA","author":"H. N. Fu","year":"2003","unstructured":"Fu, H., N. Mephu, N.E.: Partitioning large data to scale-up lattice-based algorithm. In: Proceedings of ICTAI\u201903 (15th IEEE International Conference on Tools with Artificial Intelligence), Sacramento, CA, pp. 537\u2013541. IEEE Press, Los Alamitos, CA (2003)"},{"key":"9063_CR10","unstructured":"Fu, H., N. Mephu, N.E.: How well go lattice algorithms on currently used machine learning testbeds. In: Proc. Conference EGC\u201904, Clermont-Ferrand, France, pp. 373\u2013384 (2004)"},{"key":"9063_CR11","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. In: Technische Hochschule Darmstadt, vol.\u00a0831 (1984)"},{"key":"9063_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Berlin Heidelberg New York (1999)"},{"key":"9063_CR13","first-page":"23","volume":"121","author":"A. Gu\u00e9noche","year":"1993","unstructured":"Gu\u00e9noche, A.: Construction du treillis de Galois d\u2019une relation binaire. Math. Inform. Sci. Hum. 121, 23\u201334 (1993)","journal-title":"Math. Inform. Sci. Hum."},{"key":"9063_CR14","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/S0097539792224814","volume":"28","author":"W-L. Hsu","year":"1999","unstructured":"Hsu, W-L., Ma, T-H.: Substitution decomposition on chordal graphs and its applications. SIAM J. Comput. 28, 1004\u20131020 (1999)","journal-title":"SIAM J. Comput."},{"key":"9063_CR15","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1051\/ita:2000129","volume":"34","author":"M. Huchard","year":"2000","unstructured":"Huchard, M., Dicky, H., Leblanc, H.: Galois lattice as a framework to specify building class hierarchies algorithms. Inform. Theor. Appl. 34, 521\u2013548 (2000)","journal-title":"Inform. Theor. Appl."},{"key":"9063_CR16","unstructured":"Huchard, M., Roume, C., Valtchev, P.: When concepts point at other concepts: the case of UML diagram reconstruction. In: Proceedings of FCAKDD\u201902 (Formal Concept Analysis for Knowledge Discovery in Databases), Int. Conf. ECAI\u201902, (Lyon, Fr, Juillet 2002) 32\u201343"},{"key":"9063_CR17","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D.: Listing all minimal separators of a graph. SIAM J. Comput. 27, 605\u2013613 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2-3","key":"9063_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S.O. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. (JETAI) 14(2-3), 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intell. (JETAI)"},{"key":"9063_CR19","unstructured":"Kuznetsov, S.O.: Algorithm for the construction of the set of all concepts and their line diagram. In: MATH-AI-05, TU-Dresden (2000)"},{"key":"9063_CR20","unstructured":"Liqui\u00e8re, M., Sallantin, J.: Structural machine learning with Galois lattices and Graphs. In: Kaufmann, M. (ed.) Proceedings of ICML\u201998 (International Conference on Machine Learning), pp. 305\u2013313 (1998)"},{"key":"9063_CR21","unstructured":"Malgrange, Y.: Recherche des sous-matrices premi\u00e8res d\u2019une matrice \u00e0 coefficients binaires. In: 2nd congr\u00e8s de l\u2019AFCALTI, Gauthier-Villars (Oct. 1961)"},{"key":"9063_CR22","doi-asserted-by":"crossref","unstructured":"Mephu, N.E., Njiwoua, P.: Using lattice-based framework as a tool for feature extraction. In: ECML, pp. 304\u2013309 (1998)","DOI":"10.1007\/BFb0026700"},{"issue":"2","key":"9063_CR23","first-page":"243","volume":"23","author":"E.M. Norris","year":"1978","unstructured":"Norris, E.M.: An algorithm for computing the maximal rectangles of a binary relation. Rev. Roumaine Math. Pures Appl. 23(2), 243\u2013250 (1978)","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"9063_CR24","doi-asserted-by":"crossref","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. Inf. Process. Lett. 71, 199\u2013204 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9063_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"Y. Bastide","year":"1999","unstructured":"Bastide, Y., Lakhal, L., Pasquier, N., Taouil, R.: Efficient mining of association rules using closed itemset lattices. J. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"J. Inf. Syst."},{"key":"9063_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R.E., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 146\u2013160 (1976)","journal-title":"SIAM J. Comput."},{"key":"9063_CR27","doi-asserted-by":"crossref","unstructured":"Shen, H., Li, K., Zheng, S.Q.: Separators are as simple as cutsets. In: Proc. ASIAN\u201999 (5th Asian Computer Science Conference), (Phuket, Thailand, December 1999). LNCS, vol.\u00a01742, pp.\u00a0347\u2013358 (1999)","DOI":"10.1007\/3-540-46674-6_29"},{"key":"9063_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0304-3975(97)83809-1","volume":"180","author":"H. Sheng","year":"1997","unstructured":"Sheng, H., Liang, W.: Efficient enumeration of all minimal separators in a graph. Theor. Comp. Sci. 180, 169\u2013180 (1997)","journal-title":"Theor. Comp. Sci."},{"key":"9063_CR29","unstructured":"Sigayret, A.: Data mining: une approche par les graphes. Ph.D. thesis, Universit\u00e9 Blaise Pascal (Clermont-Ferrand, Fr), DU 1405 \u2009\u2212\u2009 EDSPIC 269 (2002)"},{"key":"9063_CR30","unstructured":"Valtchef, P., Missaoui, R., Godin, R.: A Framework for Incremental Generation of Frequent Closed Item Sets. In: Proceedings of DM&DM\u201902 (Discrete Maths and Data Mining Workshop), 2nd SIAM Conference on Data Mining (SDM\u201902), Arlington, VA (2002)"},{"issue":"3","key":"9063_CR31","doi-asserted-by":"crossref","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 Math. 256(3), 801\u2013825 (2002)","journal-title":"Discrete Math."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-007-9063-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-007-9063-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-007-9063-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:51:50Z","timestamp":1559137910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-007-9063-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,8]]},"references-count":31,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2007,8,2]]}},"alternative-id":["9063"],"URL":"https:\/\/doi.org\/10.1007\/s10472-007-9063-4","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,8]]}}}