{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:16:57Z","timestamp":1743153417609,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"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_12","type":"book-chapter","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:27:55Z","timestamp":1624318075000},"page":"192-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Interactive Transition from AOC Poset to Concept Lattice"],"prefix":"10.1007","author":[{"given":"Tim","family":"Pattison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Ceglar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Albano, A.: Upper bound for the number of concepts of contra nominal-scale free contexts. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds.) Formal Concept Analysis, pp. 44\u201353. Springer (2014). DOI: https:\/\/doi.org\/10.1007\/978-3-319-07248-7_4","DOI":"10.1007\/978-3-319-07248-7_4"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Anne, B., Alain, G., Marianne, H., Amedeo, N., Alain, S.:Hermes: a simple and efficient algorithm for building the AOC-post of a binary relation. Ann. Math. Artif. Intell. 45\u201371 (2014). https:\/\/doi.org\/10.1007\/s10472-014-9418-6","DOI":"10.1007\/s10472-014-9418-6"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Formal Concept Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2","DOI":"10.1007\/978-3-642-59830-2"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Gaume, B., Navarro, E., Prade, H.: A parallel between extended formal concept analysis and bipartite graphs analysis. In: H\u00fcllermeier, E., Kruse, R., Hoffmann, F. (eds.) Computational Intelligence for Knowledge-Based System Design. LNCS, vol. 6178, pp. 270\u2013280. Springer (2010). DOI: https:\/\/doi.org\/10.1007\/978-3-642-14049-5_28","DOI":"10.1007\/978-3-642-14049-5_28"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Godin, R., Mili, H.: Building and maintaining analysis-level class hierarchies using Galois lattices. In: OOPSLA \u201993: Proceedings of the 8th Annual Conference Object-Oriented Programming Systems, Languages, and Applications. pp. 394\u2013410 (1993). 10.1145\/165854.165931","DOI":"10.1145\/165854.165931"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973). https:\/\/doi.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"key":"12_CR7","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. CLA. vol. 672, pp. 325\u2013327. CEUR-WS.org (2010)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Algorithms for the construction of concept lattices and their diagram graphs. In: Proceeding of the 5th European Conf. Principles of Data Mining and Knowledge Discovery (PKDD 2001), LNCS, vol. 2168, pp. 289\u2013300. Springer (2001). 10.1007\/3-540-44794-6\\_24","DOI":"10.1007\/3-540-44794-6_24"},{"key":"12_CR9","unstructured":"Pattison, T., Ceglar, A.: Interaction challenges for the dynamic construction of partially-ordered sets. In: Bertet, K., Rudolph, S. (eds.) Proceedings of the 11th International Conference CLA, vol. 1252, pp. 23\u201334. CEUR-WS.org (2014)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Pattison, T., Ceglar, A.: Simultaneous, polynomial-time layout of context bigraph and lattice digraph. In: Cristea, D., Le Ber, F., Sertkaya, B. (eds.) Proceedings of the 15th International Conference FCA. LNCS: Artificial Intelligence, vol. 11511, pp. 223\u2013240 (2019). 10.1007\/978-3-030-21462-3\\_15","DOI":"10.1007\/978-3-030-21462-3_15"},{"key":"12_CR11","unstructured":"Pattison, T., Ceglar, A., Weber, D.: Efficient formal concept analysis through recursive context partitioning. In: Ignatov, D.I., Nourine, L. (eds.) Proceedings of the 14th International Conference CLA, vol. 2123, pp. 219\u2013230. CEUR-WS.org (2018)"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TVCG.2007.70412","volume":"14","author":"C Plaisant","year":"2008","unstructured":"Plaisant, C., Fekete, J.D., Grinstein, G.: Promoting insight-based evaluation of visualizations: from contest to benchmark repository. IEEE Trans. Vis. Comp. Graph. 14(1), 120\u2013134 (2008). https:\/\/doi.org\/10.1109\/TVCG.2007.70412","journal-title":"IEEE Trans. Vis. Comp. Graph."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/aris.1440400120","volume":"40","author":"U Priss","year":"2006","unstructured":"Priss, U.: Formal concept analysis in information science. Ann. Rev. Inf. Sci. Tech. 40, 521\u2013543 (2006). https:\/\/doi.org\/10.1002\/aris.1440400120","journal-title":"Ann. Rev. Inf. Sci. Tech."}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:29:06Z","timestamp":1624318146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77867-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778668","9783030778675"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77867-5_12","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)"}}]}}