{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:19Z","timestamp":1759638679270,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030676575"},{"type":"electronic","value":"9783030676582"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67658-2_1","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T12:03:33Z","timestamp":1614168213000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Margin Separations in Finite Closure Systems"],"prefix":"10.1007","author":[{"given":"Florian","family":"Seiffarth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I.M., Vapnik, V.N.: Training algorithm for optimal margin classifiers. In: Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, COLT 1992, pp. 144\u2013152. ACM, New York (1992)","DOI":"10.1145\/130385.130401"},{"issue":"1\u20132","key":"1_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01222661","volume":"50","author":"V Chepoi","year":"1994","unstructured":"Chepoi, V.: Separation of two convex sets in convexity structures. J. Geom. 50(1\u20132), 30\u201351 (1994)","journal-title":"J. Geom."},{"key":"1_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M Farber","year":"1986","unstructured":"Farber, M., Jamison, R.E.: Convexity in graphs and hypergraphs. SIAM J. Algebr. Discrete Methods 7(3), 433\u2013444 (1986)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31881-1","volume-title":"Formal Concept Analysis","year":"2005","unstructured":"Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis. LNCS (LNAI), vol. 3626. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31881-1"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0893-9659(97)00053-0","volume":"10","author":"Y Kempner","year":"1997","unstructured":"Kempner, Y., Mirkin, B., Muchnik, I.: Monotone linkage clustering and quasi-concave set functions. Appl. Math. Lett. 10(4), 19\u201324 (1997)","journal-title":"Appl. Math. Lett."},{"issue":"22","key":"1_CR7","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1016\/j.disc.2009.09.001","volume":"310","author":"Y Kempner","year":"2010","unstructured":"Kempner, Y., Levit, V.E.: Duality between quasi-concave functions and monotone linkage functions. Discrete Math. 310(22), 3211\u20133218 (2010)","journal-title":"Discrete Math."},{"issue":"1","key":"1_CR8","first-page":"54","volume":"2","author":"Y Kempner","year":"2003","unstructured":"Kempner, Y., Muchnik, I.: Clustering on antimatroids and convex geometries. WSEAS Trans. Math. 2(1), 54\u201359 (2003)","journal-title":"WSEAS Trans. Math."},{"issue":"1\u20132","key":"1_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/PL00012529","volume":"74","author":"W Kubi\u015b","year":"2002","unstructured":"Kubi\u015b, W.: Separation properties of convexity spaces. J. Geometry 74(1\u20132), 110\u2013119 (2002)","journal-title":"J. Geometry"},{"key":"1_CR10","first-page":"130","volume":"5","author":"JE Mullat","year":"1976","unstructured":"Mullat, J.E.: Extremal subsystems of monotonic systems I. Avtomatica i Telemekhanika 5, 130\u2013139 (1976)","journal-title":"Avtomatica i Telemekhanika"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S-H Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62927-0"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"issue":"6","key":"1_CR13","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychol. Rev. 65(6), 386\u2013408 (1958)","journal-title":"Psychol. Rev."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-46150-8_2","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"F Seiffarth","year":"2020","unstructured":"Seiffarth, F., Horv\u00e1th, T., Wrobel, S.: Maximal closed set and half-space separations in finite closure systems. In: Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M., Robardet, C. (eds.) ECML PKDD 2019. LNCS (LNAI), vol. 11906, pp. 21\u201337. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-46150-8_2"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"van de Vel, M.: Binary convexities and distributive lattices. Proc. Lond. Math. Soc. s3-48(1), 1\u201333 (1984)","DOI":"10.1112\/plms\/s3-48.1.1"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67658-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:04:46Z","timestamp":1740351886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67658-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676575","9783030676582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67658-2_1","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":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","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":"945","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":"195","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":"21% - 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":"4,5","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":"4,4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","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)"}}]}}