{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:04:57Z","timestamp":1743113097497,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030869816"},{"type":"electronic","value":"9783030869823"}],"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-86982-3_7","type":"book-chapter","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:50:32Z","timestamp":1631904632000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving the Performance of\u00a0Lindig-Style Algorithms with Empty Intersections"],"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"}]}],"member":"297","published-online":{"date-parts":[[2021,9,15]]},"reference":[{"key":"7_CR1","unstructured":"Andrews, S.: In-close, a fast algorithm for computing formal concepts. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) Proceedings of ICCS 2009. CEUR Workshop Proceedings, vol. 483. CEUR-WS.org (2009)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-22688-5_4","volume-title":"Conceptual Structures for Discovering Knowledge","author":"S Andrews","year":"2011","unstructured":"Andrews, S.: In-Close2, a high performance formal concept miner. In: Andrews, S., Polovina, S., Hill, R., Akhgar, B. (eds.) ICCS 2011. LNCS (LNAI), vol. 6828, pp. 50\u201362. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22688-5_4"},{"key":"7_CR3","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). https:\/\/doi.org\/10.1016\/j.ins.2014.10.011","journal-title":"Inf. Sci."},{"key":"7_CR4","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":"7_CR5","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, 12\u201314 June 2018. CEUR Workshop Proceedings, vol. 2123, pp. 255\u2013266. CEUR-WS.org (2018)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-73729-2_15","volume-title":"Modeling Decisions for Artificial Intelligence","author":"R Belohlavek","year":"2007","unstructured":"Belohlavek, R., De Baets, B., Outrata, J., Vychodil, V.: Lindig\u2019s algorithm for concept lattices over graded attributes. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds.) MDAI 2007. LNCS (LNAI), vol. 4617, pp. 156\u2013167. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73729-2_15"},{"issue":"7","key":"7_CR7","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1080\/03081079.2020.1837794","volume":"49","author":"R Belohl\u00e1vek","year":"2020","unstructured":"Belohl\u00e1vek, R., Trnecka, M.: Basic level of concepts in formal concept analysis 1: formalization and utilization. Int. J. Gen. Syst. 49(7), 689\u2013706 (2020)","journal-title":"Int. J. Gen. Syst."},{"key":"7_CR8","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de galois d\u2019une correspondance. Math\u00e9matiques et Sciences humaines 96, 31\u201347 (1986)","journal-title":"Math\u00e9matiques et Sciences humaines"},{"key":"7_CR9","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. Wiley, Hoboken (2004)"},{"issue":"8","key":"7_CR10","first-page":"985","volume":"10","author":"C Carpineto","year":"2004","unstructured":"Carpineto, C., Romano, G.: Exploiting the potential of concept lattices for information retrieval with CREDO. J. Univers. Comput. Sci. 10(8), 985\u20131013 (2004)","journal-title":"J. Univers. Comput. Sci."},{"key":"7_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, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"7_CR12","volume-title":"General Lattice Theory","author":"G Gr\u00e4tzer","year":"2003","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory, 2nd edn. Birkh\u00e4user, Basel (2003)","edition":"2"},{"key":"7_CR13","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":"7_CR14","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":"2\u20133","key":"7_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"SO Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14(2\u20133), 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"7_CR16","unstructured":"Lindig, C., Gbr, G.: Fast concept analysis. In: Working with Conceptual Structures - Contributions to ICCS 2000 (2000)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-24651-0_31","volume-title":"Concept Lattices","author":"D van der Merwe","year":"2004","unstructured":"van der Merwe, D., Obiedkov, S., Kourie, D.: AddIntent: a new incremental algorithm for constructing concept lattices. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 372\u2013385. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24651-0_31"},{"issue":"5\u20136","key":"7_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L Nourine","year":"1999","unstructured":"Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inf. Process. Lett. 71(5\u20136), 199\u2013204 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_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."}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representation and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86982-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:51:39Z","timestamp":1631904699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86982-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030869816","9783030869823"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86982-3_7","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":"15 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"25","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":"11","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.56","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.54","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)"}}]}}