{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:03:53Z","timestamp":1750266233707,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031409592"},{"type":"electronic","value":"9783031409608"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-40960-8_9","type":"book-chapter","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T21:01:25Z","timestamp":1692133285000},"page":"104-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a\u00a0Flexible and\u00a0Scalable Data Stream Algorithm in\u00a0FCA"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2115-0430","authenticated-orcid":false,"given":"Nicol\u00e1s","family":"Leutwyler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3271-1742","authenticated-orcid":false,"given":"Mario","family":"Lezoche","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7533-0133","authenticated-orcid":false,"given":"Diego","family":"Torres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5537-2261","authenticated-orcid":false,"given":"Herv\u00e9","family":"Panetto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"9_CR1","unstructured":"Co, V., Taramasco, C., Astudillo, H.: Cheating to achieve formal concept analysis over a large formal context. In: CEUR Workshop Proceedings, vol. 959 (2011)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jpdc.2017.02.002","volume":"110","author":"C De Maio","year":"2017","unstructured":"De Maio, C., Fenza, G., Loia, V., Orciuoli, F.: Distributed online temporal fuzzy concept analysis for stream processing in smart cities. J. Parallel Distrib. Comput. 110, 31\u201341 (2017). https:\/\/doi.org\/10.1016\/j.jpdc.2017.02.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731517300503","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008). https:\/\/doi.org\/10.1145\/1327452.1327492. https:\/\/doi.org\/10.1145\/1327452.1327492","journal-title":"Commun. ACM"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/959242.959245","volume":"5","author":"S D\u017eeroski","year":"2003","unstructured":"D\u017eeroski, S.: Multi-relational data mining: an introduction. ACM SIGKDD Explor. Newslett. 5(1), 1\u201316 (2003). https:\/\/doi.org\/10.1145\/959242.959245. https:\/\/doi.org\/10.1145\/959242.959245","journal-title":"ACM SIGKDD Explor. Newslett."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-27057-9_11","volume-title":"Big Data Analytics","author":"V Goel","year":"2015","unstructured":"Goel, V., Chaudhary, B.D.: Concept discovery from un-constrained distributed context. In: Kumar, N., Bhatnagar, V. (eds.) BDA 2015. LNCS, vol. 9498, pp. 151\u2013164. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27057-9_11"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"publisher","unstructured":"Leutwyler, N., Lezoche, M., Torres, D.: Systematic Literature Mapping - Selected Articles Data Extraction (2022). https:\/\/doi.org\/10.5281\/zenodo.7307957","DOI":"10.5281\/zenodo.7307957"},{"key":"9_CR8","unstructured":"Majidian, A., Martin, T., Cintra, M.: Fuzzy Formal Concept Analysis and Algorithm (2011). pages: 7"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Margara, A., Rabl, T.: Definition of Data Streams. In: Sakr, S., Zomaya, A.Y. (eds.) Encyclopedia of Big Data Technologies, pp. 648\u2013652. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-77525-8_188","DOI":"10.1007\/978-3-319-77525-8_188"},{"key":"9_CR10","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"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45153-6_33","volume-title":"Advances in Artificial Intelligence","author":"R Neouchi","year":"2001","unstructured":"Neouchi, R., Tawfik, A.Y., Frost, R.A.: Towards a temporal extension of formal concept analysis. In: Stroulia, E., Matwin, S. (eds.) AI 2001. LNCS (LNAI), vol. 2056, pp. 335\u2013344. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45153-6_33"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-39451-8_20","volume-title":"KI 2003: Advances in Artificial Intelligence","author":"R Osswald","year":"2003","unstructured":"Osswald, R., Petersen, W.: A logical approach to data-driven classification. In: G\u00fcnter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol. 2821, pp. 267\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39451-8_20"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Rouane-Hacene, M., Huchard, M., Napoli, A., Valtchev, P.: Relational concept analysis: mining concept lattices from multi-relational data. Ann. Math. Artif. Intell. 67 (2013). https:\/\/doi.org\/10.1007\/s10472-012-9329-3","DOI":"10.1007\/s10472-012-9329-3"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with Titanic. Data Knowledge Engineering 42(2), 189\u2013222 (2002). https:\/\/doi.org\/10.1016\/S0169-023X(02)00057-5. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X02000575","journal-title":"Data Knowledge Engineering"},{"key":"9_CR15","unstructured":"Tamrakar, E.S.: Formal concept analysis: mathematical foundations (1997). https:\/\/www.academia.edu\/3362029\/Formal_concept_analysis_mathematical_foundations"},{"key":"9_CR16","series-title":"NATO Advanced Study Institutes Series","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets. NATO Advanced Study Institutes Series, pp. 445\u2013470. Springer, Dordrecht (1982). https:\/\/doi.org\/10.1007\/978-94-009-7798-3_15"},{"key":"9_CR17","unstructured":"Wolff, K.E.: Temporal Concept Analysis (2001)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-29892-9_26","volume-title":"Formal Concept Analysis","author":"B Xu","year":"2012","unstructured":"Xu, B., de Fr\u00e9in, R., Robson, E., \u00d3 Foghl\u00fa, M.: Distributed formal concept analysis algorithms based on an iterative MapReduce framework. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol. 7278, pp. 292\u2013308. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29892-9_26"}],"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-031-40960-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T07:04:29Z","timestamp":1696057469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40960-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031409592","9783031409608"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40960-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 August 2023","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":"Berlin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2023","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":"28","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":"9","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":"32% - 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":"3","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":"4 poster papers (not part of the 28)","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)"}}]}}