{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:15:21Z","timestamp":1760080521905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030778668"},{"type":"electronic","value":"9783030778675"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77867-5_6","type":"book-chapter","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:27:55Z","timestamp":1624318075000},"page":"91-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis"],"prefix":"10.1007","author":[{"given":"Radek","family":"Janostik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Konecny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kraj\u010da","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"6_CR1","unstructured":"Andrews, S.: In-Close, a fast algorithm for computing formal concepts. In: International Conference on Conceptual Structures (ICCS), Moscow (2009)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-59271-8_4","volume-title":"Formal Concept Analysis","author":"S Andrews","year":"2017","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.) ICFCA 2017. LNCS (LNAI), vol. 10308, pp. 56\u201371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59271-8_4"},{"key":"6_CR3","unstructured":"Andrews, S.: A new method for inheriting canonicity test failures in close-by-one type algorithms (2018)"},{"issue":"1\u20132","key":"6_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10472-013-9353-y","volume":"70","author":"K Bazhanov","year":"2014","unstructured":"Bazhanov, K., Obiedkov, S.A.: Optimizations in computing the Duquenne-Guigues basis of implications. Ann. Math. Artif. Intell. 70(1\u20132), 5\u201324 (2014)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C Beeri","year":"1979","unstructured":"Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. (TODS) 4(1), 30\u201359 (1979)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"6_CR6","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"6_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, Heidelberg (1999)"},{"key":"6_CR8","first-page":"5","volume":"95","author":"J-L Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Familles minimales d\u2019implications informatives resultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. Humaines 95, 5\u201318 (1986)","journal-title":"Math. Sci. Humaines"},{"key":"6_CR9","unstructured":"Janostik, R., Konecny, J., Kraj\u010da, P.: LCM is well implemented CbO: study of LCM from FCA point of view. CoRR, abs\/2010.06980 (2020)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Janostik, R., Konecny, J., Kraj\u010da, P.: LinCbO: fast algorithm for computation of the Duquenne-Guigues basis. CoRR, abs\/2011.04928 (2020)","DOI":"10.1016\/j.ins.2021.04.104"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-57855-8_8","volume-title":"Ontologies and Concepts in Mind and Machine","author":"J Konecny","year":"2020","unstructured":"Konecny, J., Kraj\u010da, P.: Pruning in map-reduce style CbO algorithms. In: Alam, M., Braun, T., Yun, B. (eds.) ICCS 2020. LNCS (LNAI), vol. 12277, pp. 103\u2013116. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57855-8_8"},{"key":"6_CR12","first-page":"325","volume":"672","author":"P Kraj\u010da","year":"2010","unstructured":"Kraj\u010da, P., Outrata, J., Vychodil, V.: Advances in algorithms based on CbO. CLA 672, 325\u2013337 (2010)","journal-title":"CLA"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","volume":"59","author":"P Kraj\u010da","year":"2010","unstructured":"Kraj\u010da, 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":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-03915-7_29","volume-title":"Advances in Intelligent Data Analysis VIII","author":"P Krajca","year":"2009","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.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 333\u2013344. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03915-7_29"},{"key":"6_CR15","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":"8","key":"6_CR16","first-page":"927","volume":"10","author":"SO Kuznetsov","year":"2004","unstructured":"Kuznetsov, S.O.: On the intractability of computing the Duquenne-Guigues base. J. Univ. Comput. Sci. 10(8), 927\u2013933 (2004)","journal-title":"J. Univ. Comput. Sci."},{"key":"6_CR17","volume-title":"The Theory of Relational Databases","author":"D Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases, vol. 11. Computer Science Press, Rockville (1983)"},{"issue":"1\u20134","key":"6_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10472-007-9057-2","volume":"49","author":"SA Obiedkov","year":"2007","unstructured":"Obiedkov, S.A., Duquenne, V.: Attribute-incremental construction of the canonical implication basis. .Ann. Math. Artif. Intell. 49(1\u20134), 77\u201399 (2007)","journal-title":".Ann. Math. Artif. Intell."},{"issue":"1","key":"6_CR19","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":"6_CR20","unstructured":"Uno, T., Asai, T., Uchida, Y., Hiroki A.: LCM: an efficient algorithm for enumerating frequent closed item sets. In: FIMI, vol. 90. Citeseer (2003)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Discovery Science","author":"T Uno","year":"2004","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16\u201331. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30214-8_2"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: FIMI, vol. 126 (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 77\u201386. ACM (2005)","DOI":"10.1145\/1133905.1133916"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0030825","volume-title":"Computing and Combinatorics","author":"M Wild","year":"1995","unstructured":"Wild, M.: Computations with finite closure systems and implications. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 111\u2013120. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030825"}],"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-77867-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T06:31:44Z","timestamp":1699165904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77867-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778668","9783030778675"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77867-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 June 2021","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":"Strasbourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfca2021.sciencesconf.org\/","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","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":"14","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":"44% - 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":"1,6","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)"}}]}}