{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:51Z","timestamp":1740123891449,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:00:00Z","timestamp":1643587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:00:00Z","timestamp":1643587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007059","name":"Univerzita Palack\u00e9ho v Olomouci","doi-asserted-by":"publisher","award":["JG\u02d92019\u02d9008"],"award-info":[{"award-number":["JG\u02d92019\u02d9008"]}],"id":[{"id":"10.13039\/501100007059","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10472-022-09787-1","type":"journal-article","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T14:02:58Z","timestamp":1643637778000},"page":"1107-1124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On pruning techniques in map-reduce style CbO algorithms"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3934-5690","authenticated-orcid":false,"given":"Jan","family":"Konecny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4278-3130","authenticated-orcid":false,"given":"Petr","family":"Kraj\u010da","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"key":"9787_CR1","unstructured":"Akhmatnurov, M., Ignatov, D.I.: Context-aware recommender system based on boolean matrix factorisation. In: Yahia, S.B., Konecny, J. (eds.) Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, France, October 13-16, 2015, CEUR Workshop Proceedings. CEUR-WS.org, vol. 1466, pp 99\u2013110 (2015)"},{"key":"9787_CR2","unstructured":"Andrews, S.: In-close, a fast algorithm for computing formal concepts. In: International Conference on Conceptual Structures. Springer (2009)"},{"key":"9787_CR3","doi-asserted-by":"crossref","unstructured":"Andrews, S.: In-close2, a high performance formal concept miner. In: Andrews, S., Polovina, S., Hill, R., Akhgar, B. (eds.) Conceptual Structures for Discovering Knowledge - 19th International Conference on Conceptual Structures, ICCS 2011, Derby, UK, July 25-29, 2011. Proceedings, Lecture Notes in Computer Science, vol. 6828, pp 50\u201362. Springer (2011)","DOI":"10.1007\/978-3-642-22688-5_4"},{"key":"9787_CR4","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.ins.2014.10.011","volume":"295","author":"S Andrews","year":"2015","unstructured":"Andrews, S.: A \u2018Best-of-Breed\u2019 approach for designing a fast algorithm for computing fixpoints of Galois connections. Inf. Sci. 295, 633\u2013649 (2015)","journal-title":"Inf. Sci."},{"key":"9787_CR5","doi-asserted-by":"crossref","unstructured":"Andrews, S.: Making use of empty intersections to improve the performance of CbO-type algorithms. In: Bertet, K., Borchmann, D., Cellier, P., Ferr\u00e9, S. (eds.) Formal Concept Analysis - 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10308, pp 56\u201371. Springer (2017)","DOI":"10.1007\/978-3-319-59271-8_4"},{"key":"9787_CR6","unstructured":"Andrews, S.: A new method for inheriting canonicity test failures in Close-by-One type algorithms. In: Ignatov, D.I., Nourine, L. (eds.) Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, CLA 2018, Olomouc, Czech Republic, June 12-14, 2018, CEUR Workshop Proceedings. CEUR-WS.org, vol. 2123, pp 255\u2013266 (2018)"},{"issue":"1","key":"9787_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R Belohl\u00e1vek","year":"2010","unstructured":"Belohl\u00e1vek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. Syst. Sci. 76(1), 3\u201320 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9787_CR8","first-page":"1850029","volume":"17","author":"RK Chunduri","year":"2018","unstructured":"Chunduri, R.K., Cherukuri, A.K.: Haloop approach for concept generation in formal concept analysis. JIKM 17(3), 1850029 (2018)","journal-title":"JIKM"},{"key":"9787_CR9","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: Brewer, E.A., Chen, P. (eds.) 6th Symposium on Operating System Design and Implementation (OSDI 2004), San Francisco, California, USA, December 6-8, 2004. USENIX Association, pp 137\u2013150 (2004)"},{"key":"9787_CR10","doi-asserted-by":"publisher","unstructured":"Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S., Qiu, J., Fox, G.C.: Twister: a runtime for iterative mapreduce. In: Hariri, S., Keahey, K. (eds.) Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, HPDC 2010, June 21-25, 2010. https:\/\/doi.org\/10.1145\/1851476.1851593, pp 810\u2013818. ACM, Chicago, Illinois, USA (2010)","DOI":"10.1145\/1851476.1851593"},{"key":"9787_CR11","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-Verlag, Berlin Heidelberg (1999)"},{"key":"9787_CR12","doi-asserted-by":"crossref","unstructured":"Konecny, J., Krajca, P.: Pruning in map-reduce style CbO algorithms. In: Alam, M., Braun, T., Yun, B. (eds.) Ontologies and Concepts in Mind and Machine - 25th International Conference on Conceptual Structures, ICCS 2020, Bolzano, Italy, September 18-20, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12277, pp 103\u2013116. Springer (2020)","DOI":"10.1007\/978-3-030-57855-8_8"},{"key":"9787_CR13","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Advances in algorithms based on CbO. In: Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, Spain, October 19-21, 2010, pp 325\u2013337 (2010)"},{"issue":"2","key":"9787_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","volume":"59","author":"P Krajca","year":"2010","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel algorithm for computing fixpoints of Galois connections. Ann. Math. Artif. Intell. 59(2), 257\u2013272 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9787_CR15","unstructured":"Krajca, P., Vychodil, V.: Distributed algorithm for computing formal concepts using map-reduce framework. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J. (eds.) Advances in Intelligent Data Analysis VIII, 8th International Symposium on Intelligent Data Analysis, IDA 2009, Lyon, France, August 31 - September 2, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5772, pp 333\u2013344. Springer (2009)"},{"key":"9787_CR16","unstructured":"Kuznetsov, S.O.: A fast algorithm for computing all intersections of objects from an arbitrary semilattice. Nauchno-Tekhnicheskaya Informatsiya Seriya 2-Informatsionnye Protsessy i Sistemy (1), 17\u201320 (1993)"},{"issue":"1","key":"9787_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","volume":"185","author":"J Outrata","year":"2012","unstructured":"Outrata, J., Vychodil, V.: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf. Sci. 185(1), 114\u2013127 (2012)","journal-title":"Inf. Sci."},{"key":"9787_CR18","doi-asserted-by":"crossref","unstructured":"Poelmans, J., Ignatov, D.I., Viaene, S., Dedene, G., Kuznetsov, S.O.: Text mining scientific papers: A survey on fca-based information retrieval research. In: Perner, P. (ed.) Advances in Data Mining. Applications and Theoretical Aspects - 12th Industrial Conference, ICDM 2012, Berlin, Germany, July 13-20, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7377, pp 273\u2013287. Springer (2012)","DOI":"10.1007\/978-3-642-31488-9_22"},{"key":"9787_CR19","doi-asserted-by":"crossref","unstructured":"Xu, B., de Fr\u00e9in, R., Robson, E., Foghl\u00fa, M.\u00d3.: Distributed formal concept analysis algorithms based on an iterative mapreduce framework. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) Formal Concept Analysis - 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7278, pp 292\u2013308. Springer (2012)","DOI":"10.1007\/978-3-642-29892-9_26"},{"key":"9787_CR20","doi-asserted-by":"crossref","unstructured":"Zaharia, M., Das, T., Li, H., Shenker, S., Stoica, I.: Discretized streams: An efficient and fault-tolerant model for stream processing on large clusters. In: Fonseca, R., Maltz, D.A. (eds.) 4th USENIX Workshop on Hot Topics in Cloud Computing, HotCloud\u201912, Boston, MA, USA, June 12-13, 2012. USENIX Association (2012)","DOI":"10.21236\/ADA575859"},{"issue":"3","key":"9787_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Discov. 9(3), 223\u2013248 (2004)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09787-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-022-09787-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09787-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T08:17:25Z","timestamp":1669623445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-022-09787-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,31]]},"references-count":21,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["9787"],"URL":"https:\/\/doi.org\/10.1007\/s10472-022-09787-1","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2022,1,31]]},"assertion":[{"value":"10 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}