{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:39:16Z","timestamp":1742924356095,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031089701"},{"type":"electronic","value":"9783031089718"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08971-8_8","type":"book-chapter","created":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T23:02:52Z","timestamp":1656889372000},"page":"87-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the\u00a0Mixed Concept Lattice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7518-1828","authenticated-orcid":false,"given":"Francisco","family":"P\u00e9rez-G\u00e1mez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5506-6467","authenticated-orcid":false,"given":"Pablo","family":"Cordero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0531-4055","authenticated-orcid":false,"given":"Manuel","family":"Enciso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0172-1585","authenticated-orcid":false,"given":"Domingo","family":"L\u00f3pez-Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4548-8030","authenticated-orcid":false,"given":"\u00c1ngel","family":"Mora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Cordero, P., Enciso, M., L\u00f3pez, D., Mora, A.: A conversational recommender system for diagnosis using fuzzy rules. Expert Syst. Appl. 154, 113449 (2020)","DOI":"10.1016\/j.eswa.2020.113449"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.knosys.2015.07.018","volume":"87","author":"P Cordero","year":"2015","unstructured":"Cordero, P., Enciso, M., Mora, A., Ojeda-Aciego, M., Rossi, C.: Knowledge discovery in social networks by using a logic-based treatment of implications. Knowl. Based Syst. 87, 16\u201325 (2015)","journal-title":"Knowl. Based Syst."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.2991\/ijcis.d.200806.001","volume":"13","author":"P Cordero","year":"2020","unstructured":"Cordero, P., Enciso, M., Mora, \u00c1., Ojeda-Aciego, M., Rossi, C.: A formal concept analysis approach to cooperative conversational recommendation. Int. J. Comput. Intell. Syst. 13, 1243\u20131252 (2020)","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-49291-8_6","volume-title":"Conceptual Exploration","author":"B Ganter","year":"2016","unstructured":"Ganter, B., Obiedkov, S.: More expressive variants of exploration. In: Conceptual Exploration, pp. 237\u2013292. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49291-8_6"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-030-77867-5_19","volume-title":"Formal Concept Analysis","author":"U Priss","year":"2021","unstructured":"Priss, U.: Diagrammatic representation of conceptual structures. In: Braud, A., Buzmakov, A., Hanika, T., Le Ber, F. (eds.) ICFCA 2021. LNCS (LNAI), vol. 12733, pp. 281\u2013289. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77867-5_19"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-74553-2_27","volume-title":"Data Warehousing and Knowledge Discovery","author":"G Gasmi","year":"2007","unstructured":"Gasmi, G., Yahia, S.B., Nguifo, E.M., Bouker, S.: Extraction of association rules based on literalsets. In: Song, I.Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 293\u2013302. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74553-2_27"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"159549","DOI":"10.1109\/ACCESS.2021.3131987","volume":"9","author":"MH Ibrahim","year":"2021","unstructured":"Ibrahim, M.H., Missaoui, R., Vaillancourt, J.: Identifying influential nodes in two-mode data networks using formal concept analysis. IEEE Access 9, 159549\u2013159565 (2021)","journal-title":"IEEE Access"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ijar.2020.02.009","volume":"120","author":"J Konecny","year":"2020","unstructured":"Konecny, J.: Attribute implications in L-concept analysis with positive and negative attributes: validity and properties of models. Int. J. Approximate Reasoning 120, 203\u2013215 (2020)","journal-title":"Int. J. Approximate Reasoning"},{"key":"8_CR9","unstructured":"Messaoudi, A., Missaoui, R., Ibrahim, M.-H.: Detecting overlapping communities in two-mode data networks using formal concept analysis. Revue des Nouvelles Technologies de l\u2019Information, Extraction et Gestion des connaissances, RNTI-E-, 35 189\u2013200 2019"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-78137-0_13","volume-title":"Formal Concept Analysis","author":"R Missaoui","year":"2008","unstructured":"Missaoui, R., Nourine, L., Renaud, Y.: Generating positive and negative exact rules using formal concept analysis: problems and solutions. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 169\u2013181. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78137-0_13"},{"issue":"4","key":"8_CR11","first-page":"357","volume":"115","author":"R Missaoui","year":"2012","unstructured":"Missaoui, R., Nourine, L., Renaud, Y.: Computing implications with negation from a formal context. Fund. Inform. 115(4), 357\u2013375 (2012)","journal-title":"Fund. Inform."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/j.procs.2014.05.325","volume":"31","author":"JM Rodr\u00edguez-Jim\u00e9nez","year":"2014","unstructured":"Rodr\u00edguez-Jim\u00e9nez, J.M., Cordero, P., Enciso, M., Mora, A.: Negative attributes and implications in formal concept analysis. Procedia Comput. Sci. 31, 758\u2013765 (2014)","journal-title":"Procedia Comput. Sci."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ins.2016.06.015","volume":"369","author":"J Rodr\u00edguez-Jim\u00e9nez","year":"2016","unstructured":"Rodr\u00edguez-Jim\u00e9nez, J., Cordero, P., Enciso, M., Rudolph, S.: Concept lattices with negative information: a characterization theorem. Inf. Sci. 369, 51\u201362 (2016)","journal-title":"Inf. Sci."},{"issue":"16","key":"8_CR14","doi-asserted-by":"publisher","first-page":"4829","DOI":"10.1002\/mma.3814","volume":"39","author":"JM Rodr\u00edguez-Jim\u00e9nez","year":"2016","unstructured":"Rodr\u00edguez-Jim\u00e9nez, J.M., Cordero, P., Enciso, M., Mora, A.: Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis. Math. Methods Appli. Sci. 39(16), 4829\u20134845 (2016)","journal-title":"Math. Methods Appli. Sci."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume":"83","author":"R Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. Ordered Sets 83, 445\u2013470 (1982)","journal-title":"Ordered Sets"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08971-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T23:13:37Z","timestamp":1656890017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08971-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031089701","9783031089718"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08971-8_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2022.disco.unimib.it\/","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"188","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":"124","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":"0","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":"66% - 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)"}}]}}