{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T17:30:21Z","timestamp":1767720621111},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642039140"},{"type":"electronic","value":"9783642039157"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03915-7_29","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T11:55:29Z","timestamp":1251287729000},"page":"333-344","source":"Crossref","is-referenced-by-count":28,"title":["Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework"],"prefix":"10.1007","author":[{"given":"Petr","family":"Krajca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vilem","family":"Vychodil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Belohlavek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. Journal of Computer and System Sciences (to appear)","DOI":"10.1016\/j.jcss.2009.05.002"},{"key":"29_CR2","doi-asserted-by":"publisher","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. Annals of Mathematics and Artificial Intelligence\u00a049, 117\u2013136 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"29_CR3","doi-asserted-by":"publisher","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. J. Wiley, Chichester (2004)"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"29_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-24651-0_33","volume-title":"Concept Lattices","author":"H. Fu","year":"2004","unstructured":"Fu, H., Nguifo, E.M.: A parallel algorithm to generate formal concepts for large data. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 394\u2013401. Springer, Heidelberg (2004)"},{"key":"29_CR6","unstructured":"Ganter, B.: Two basic algorithms in concept analysis (Technical Report FB4-Preprint No.\u00a0831). TH Darmstadt (1984)"},{"key":"29_CR7","doi-asserted-by":"publisher","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":"29_CR8","unstructured":"Hadoop Core Framework, \n                    \n                      http:\/\/hadoop.apache.org\/"},{"key":"29_CR9","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD Archive University of California, Irvine, School of Information and Computer Sciences (1999)"},{"key":"29_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-32262-7_17","volume-title":"Formal Concept Analysis","author":"J.F.D. Kengue","year":"2005","unstructured":"Kengue, J.F.D., Valtchev, P., Djamegni, C.T.: A parallel algorithm for lattice construction. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 249\u2013264. Springer, Heidelberg (2005)"},{"key":"29_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11871637_33","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"P. Miettinen","year":"2006","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 335\u2013346. Springer, Heidelberg (2006)"},{"key":"29_CR12","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel Recursive Algorithm for FCA. In: Belohlavek, R., Kuznetsov, S.O. (eds.) Proc. CLA 2008, vol.\u00a0433, pp. 71\u201382. CEUR WS (2008) ISBN 978\u201380\u2013244\u20132111\u20137"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel Algorithm for Computing Fixpoints of Galois Connections. Annals of Mathematics and Artificial Intelligence (submitted)","DOI":"10.1007\/s10472-010-9199-5"},{"issue":"1","key":"29_CR14","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. Automatic Documentation and Mathematical Linguistics\u00a024(1), 37\u201345 (1989)","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"issue":"5","key":"29_CR15","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\u044c\u0131\u0441\u0442\u0440\u044b\u0439 \u0430\u041b\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\u03b4\u042a\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\u00a027(5), 11\u201321 (1993)","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"key":"29_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S.O. Kuznetsov","year":"1999","unstructured":"Kuznetsov, S.O.: Learning of simple conceptual graphs from positive and negative examples. In: \u017bytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol.\u00a01704, pp. 384\u2013391. Springer, Heidelberg (1999)"},{"key":"29_CR17","doi-asserted-by":"publisher","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.\u00a014, 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Int."},{"key":"29_CR18","first-page":"152","volume-title":"Working with Conceptual Structures -\u2014 Contributions to ICCS 2000","author":"C. Lindig","year":"2000","unstructured":"Lindig, C.: Fast concept analysis. In: Working with Conceptual Structures -\u2014 Contributions to ICCS 2000, pp. 152\u2013161. Shaker Verlag, Aachen (2000)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ordered Sets, Dordrecht, Boston, pp. 445\u2013470 (1982)","DOI":"10.1007\/978-94-009-7798-3_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis VIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03915-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T15:14:36Z","timestamp":1552144476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03915-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642039140","9783642039157"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03915-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}