{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:09Z","timestamp":1759063749979},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"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":[[2010,6]]},"DOI":"10.1007\/s10472-010-9199-5","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T04:27:02Z","timestamp":1278649622000},"page":"257-272","source":"Crossref","is-referenced-by-count":34,"title":["Parallel algorithm for computing fixpoints of Galois connections"],"prefix":"10.1007","volume":"59","author":[{"given":"Petr","family":"Krajca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Outrata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vilem","family":"Vychodil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,10]]},"reference":[{"key":"9199_CR1","volume-title":"UCI Machine learning repository","author":"A Asuncion","year":"2007","unstructured":"Asuncion, A., Newman, D: UCI Machine learning repository. School of Information and Computer Sciences, University of California, Irvine (2007)"},{"key":"9199_CR2","unstructured":"Baklouti, F., Levy G.: A distributed version of the Ganter algorithm for general Galois Lattices. In: Belohlavek, R., Snasel, V. (eds.) Proc. CLA, pp. 207\u2013221 (2005)"},{"key":"9199_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R Belohlavek","year":"2010","unstructured":"Belohlavek, R., Vychodil V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. Syst. Sci. 76, 3\u201320 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"9199_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-007-9063-4","volume":"49","author":"A Berry","year":"2007","unstructured":"Berry, A., Bordat, J.-P., Sigayret, A.: A local approach to concept generation. Ann. Math. Artif. Intell. 49, 117\u2013136 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9199_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0470011297","volume-title":"Concept Data Analysis. Theory and Applications","author":"C Carpineto","year":"2004","unstructured":"Carpineto, C., Romano, G.: Concept Data Analysis. Theory and Applications. Wiley, New York (2004)"},{"key":"9199_CR6","first-page":"394","volume":"2961","author":"H Fu","year":"2004","unstructured":"Fu, H., Mephu Nguifo, E.: A Parallel Algorithm to Generate Formal Concepts for Large Data. ICFCA, LNCS 2961, 394\u2013401 (2004)","journal-title":"ICFCA, LNCS"},{"key":"9199_CR7","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. (Technical Report FB4-Preprint No.\u00a0831). TH Darmstadt (1984)"},{"key":"9199_CR8","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, Berlin (1999)"},{"key":"9199_CR9","volume-title":"General Lattice Theory","author":"G Gr\u00e4tzer","year":"2003","unstructured":"Gr\u00e4tzer G. et al.: General Lattice Theory, 2nd edn. Birkh\u00e4user, Basel (2003)","edition":"2"},{"key":"9199_CR10","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD Archive University of California, Irvine, School of Information and Computer Sciences (1999)"},{"issue":"3","key":"9199_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"9199_CR12","first-page":"249","volume":"3403","author":"JFD Kengue","year":"2005","unstructured":"Kengue J. F. D., Valtchev P., Djam\u00e9gni\u00a0C. T.: A parallel algorithm for lattice construction. ICFCA, LNCS 3403, 249\u2013264 (2005)","journal-title":"ICFCA, LNCS"},{"issue":"1","key":"9199_CR13","first-page":"37","volume":"24","author":"S Kuznetsov","year":"1989","unstructured":"Kuznetsov, S.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Autom. Doc. Math. Linguist. 24(1), 37\u201345 (1989)","journal-title":"Autom. Doc. Math. Linguist."},{"issue":"5","key":"9199_CR14","first-page":"11","volume":"27","author":"S Kuznetsov","year":"1993","unstructured":"Kuznetsov, S.: A fast algorithm for computing all intersections of objects in a finite semi-lattice (\u0411\u044b\u0441\u0442\u0440\u044b\u0439 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u043f\u043e\u0441\u0442\u0440\u043e\u0435\u043d\u0438\u044f \u0432\u0441\u0435\u0445 \u043f\u0435\u0440\u0435\u0441\u0435\u0447\u0435\u043d\u0438\u0439 \u043e\u0431I\u0435\u043a\u0442\u043e\u0432 \u0438\u0437 \u043a\u043e\u043d\u0435\u0447\u043d\u043e\u0439 \u043f\u043e\u043b\u0443\u0440\u0435\u0448\u0435\u0442\u043a\u0438, in Russian). Automatic Documentation and Mathematical Linguistics, 27(5), 11\u201321 (1993)","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"key":"9199_CR15","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S.: Learning of simple conceptual graphs from positive and negative examples. PKDD, pp. 384\u2013391 (1999)","DOI":"10.1007\/978-3-540-48247-5_47"},{"key":"9199_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S Kuznetsov","year":"2002","unstructured":"Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Int. 14, 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Int."},{"key":"9199_CR17","unstructured":"Lindig, C.: Fast concept analysis. Working with Conceptual Structures\u2014Contributions to ICCS 2000, pp. 152\u2013161. Shaker, Aachen (2000)"},{"issue":"2","key":"9199_CR18","first-page":"243","volume":"23","author":"EM Norris","year":"1978","unstructured":"Norris, E.M.: An Algorithm for computing the maximal rectangles in a binary relation. Rev. Roum. Math. Pures. Appl. 23(2), 243\u2013250 (1978)","journal-title":"Rev. Roum. Math. Pures. Appl."},{"key":"9199_CR19","first-page":"445","volume-title":"Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. Ordered Sets","author":"R Wille","year":"1982","unstructured":"Wille, R.: Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. Ordered Sets, pp. 445\u2013470, Reidel, Dordrecht (1982)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-010-9199-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-010-9199-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-010-9199-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:38:19Z","timestamp":1559255899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-010-9199-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9199"],"URL":"https:\/\/doi.org\/10.1007\/s10472-010-9199-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}