{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:44:29Z","timestamp":1777571069535,"version":"3.51.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030214616","type":"print"},{"value":"9783030214623","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21462-3_14","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:05:15Z","timestamp":1560452715000},"page":"208-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallelization of the GreConD Algorithm for\u00a0Boolean Matrix Factorization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4278-3130","authenticated-orcid":false,"given":"Petr","family":"Kraj\u010da","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7770-2033","authenticated-orcid":false,"given":"Martin","family":"Trnecka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"14_CR1","unstructured":"Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming. Addison-Wesley, Reading (2002)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ins.2018.05.016","volume":"459","author":"R Belohlavek","year":"2018","unstructured":"Belohlavek, R., Outrata, J., Trnecka, M.: Toward quality assessment of Boolean matrix factorizations. Inf. Sci. 459, 71\u201385 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.05.016","journal-title":"Inf. Sci."},{"issue":"8","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R Belohlavek","year":"2015","unstructured":"Belohlavek, R., Trnecka, M.: From-below approximations in Boolean matrix factorization: geometry and new algorithm. J. Comput. Syst. Sci. 81(8), 1678\u20131697 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.06.002","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","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(1), 3\u201320 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.05.002","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Ene, A., Horne, W.G., Milosavljevic, N., Rao, P., Schreiber, R., Tarjan, R.E.: Fast exact and heuristic methods for role minimization problems. In: Ray, I., Li, N. (eds.) 13th ACM Symposium on Access Control Models and Technologies, SACMAT 2008, Estes Park, CO, USA, 11\u201313 June 2008, Proceedings, pp. 1\u201310. ACM (2008). https:\/\/doi.org\/10.1145\/1377836.1377838","DOI":"10.1145\/1377836.1377838"},{"key":"14_CR6","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, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"issue":"8","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3016078.2851152","volume":"51","author":"Ramakrishnan Kannan","year":"2016","unstructured":"Kannan, R., Ballard, G., Park, H.: A high-performance parallel algorithm for nonnegative matrix factorization. SIGPLAN Not. 51(8), 9:1\u20139:11 (2016). https:\/\/doi.org\/10.1145\/3016078.2851152","journal-title":"ACM SIGPLAN Notices"},{"key":"14_CR8","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Advances in algorithms based on CbO. In: Kryszkiewicz, M., Obiedkov, S.A. (eds.) Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, Spain, 19\u201321 October 2010. CEUR Workshop Proceedings, vol. 672, pp. 325\u2013337. CEUR-WS.org (2010)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science (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":"SO 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. 1704, pp. 384\u2013391. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48247-5_47"},{"issue":"12","key":"14_CR10","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1109\/TKDE.2013.181","volume":"26","author":"C Lucchese","year":"2014","unstructured":"Lucchese, C., Orlando, S., Perego, R.: A unifying framework for mining approximate top-k binary patterns. IEEE Trans. Knowl. Data Eng. 26(12), 2900\u20132913 (2014). https:\/\/doi.org\/10.1109\/TKDE.2013.181","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE Trans. Knowl. Data Eng. 20(10), 1348\u20131362 (2008). https:\/\/doi.org\/10.1109\/TKDE.2008.53","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jpdc.2018.09.014","volume":"123","author":"J Outrata","year":"2019","unstructured":"Outrata, J., Trnecka, M.: Parallel exploration of partial solutions in Boolean matrix factorization. J. Parallel Distrib. Comput. 123, 180\u2013191 (2019). https:\/\/doi.org\/10.1016\/j.jpdc.2018.09.014","journal-title":"J. Parallel Distrib. Comput."},{"key":"14_CR13","unstructured":"Stockmeyer, L.J.: The Set Basis Problem is NP-complete. Research reports, IBM Thomas J. Watson Research Division (1975)"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Tatti, N., Mielik\u00e4inen, T., Gionis, A., Mannila, H.: What is the dimension of your binary data? In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), Hong Kong, China, 18\u201322 December 2006, pp. 603\u2013612. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/ICDM.2006.167","DOI":"10.1109\/ICDM.2006.167"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10618-010-0203-9","volume":"23","author":"Y Xiang","year":"2011","unstructured":"Xiang, Y., Jin, R., Fuhry, D., Dragan, F.F.: Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. 23(2), 215\u2013251 (2011). https:\/\/doi.org\/10.1007\/s10618-010-0203-9","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21462-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:57:20Z","timestamp":1710233840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"plus 4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}