{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:03:23Z","timestamp":1742987003377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"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_15","type":"book-chapter","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T21:01:25Z","timestamp":1692133285000},"page":"189-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Factorization of\u00a0Formal Contexts from\u00a0Modal Operators"],"prefix":"10.1007","author":[{"given":"Roberto G.","family":"Arag\u00f3n","sequence":"first","affiliation":[]},{"given":"Jes\u00fas","family":"Medina","sequence":"additional","affiliation":[]},{"given":"Elo\u00edsa","family":"Ram\u00edrez-Poussa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"15_CR1","first-page":"107","volume":"1601","author":"RG Arag\u00f3n","year":"2022","unstructured":"Arag\u00f3n, R.G., Medina, J., Ram\u00edrez-Poussa, E.: Study on the necessity operator to factorize formal contexts in a multi-adjoint framework. Commun. Comput. Inf. Sci. 1601, 107\u2013117 (2022)","journal-title":"Commun. Comput. Inf. Sci."},{"key":"15_CR2","unstructured":"Arag\u00f3n, R.G., Medina, J., Ram\u00edrez-Poussa, E.: Possibility theory and thresholds for factorizing multi-adjoint contexts, pp. 8\u20139. BoA (2022)"},{"issue":"1\u20134","key":"15_CR3","first-page":"195","volume":"75","author":"D Dubois","year":"2007","unstructured":"Dubois, D., de Saint-Cyr, F.D., Prade, H.: A possibility-theoretic view of formal concept analysis. Fund. Inform. 75(1\u20134), 195\u2013213 (2007)","journal-title":"Fund. Inform."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.fss.2011.02.008","volume":"196","author":"D Dubois","year":"2012","unstructured":"Dubois, D., Prade, H.: Possibility theory and formal concept analysis: characterizing independent sub-contexts. Fuzzy Sets Syst. 196, 4\u201316 (2012)","journal-title":"Fuzzy Sets Syst."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"D\u00fcntsch, N., Gediga, G.: Modal-style operators in qualitative data analysis. In: 2002 IEEE International Conference on Data Mining, pp. 155\u2013162 (2002)","DOI":"10.1109\/ICDM.2002.1183898"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24615-2_10","volume-title":"Theory and Applications of Relational Structures as Knowledge Instruments","author":"I D\u00fcntsch","year":"2003","unstructured":"D\u00fcntsch, I., Gediga, G.: Approximation operators in qualitative data analysis. In: de Swart, H., Or\u0142owska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 214\u2013230. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24615-2_10"},{"issue":"8","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1007\/s00153-004-0240-4","volume":"43","author":"G Georgescu","year":"2004","unstructured":"Georgescu, G., Popescu, A.: Non-dual fuzzy connections. Arch. Math. Logic 43(8), 1009\u20131039 (2004)","journal-title":"Arch. Math. Logic"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11847465_14","volume-title":"Transactions on Rough Sets V","author":"Y Yao","year":"2006","unstructured":"Yao, Y., Chen, Y.: Rough set approximations in formal concept analysis. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 285\u2013305. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847465_14"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:09:36Z","timestamp":1729922976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40960-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031409592","9783031409608"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40960-8_15","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)"}}]}}