{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T18:48:11Z","timestamp":1784054891818,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031188398","type":"print"},{"value":"9783031188404","type":"electronic"}],"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-18840-4_8","type":"book-chapter","created":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T07:04:51Z","timestamp":1667631891000},"page":"104-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incremental Update of\u00a0Locally Optimal Classification Rules"],"prefix":"10.1007","author":[{"given":"Van Quoc Phuong","family":"Huynh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Beck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,6]]},"reference":[{"key":"8_CR1","first-page":"1601","volume":"11","author":"A Bifet","year":"2010","unstructured":"Bifet, A., Holmes, G., Kirkby, R., Pfahringer, B.: MOA: massive online analysis. J. Mach. Learn. Res. 11, 1601\u20131604 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR2","unstructured":"Cestnik, B.: Estimating probabilities: a crucial task in machine learning. In: Aiello, L. (ed.) Proceedings of the 9th European Conference on Artificial Intelligence (ECAI-90), Stockholm, Sweden, pp. 147\u2013150. Pitman (1990)"},{"issue":"13","key":"8_CR3","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"ZH Deng","year":"2015","unstructured":"Deng, Z.H., Lv, S.L.: PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst. Appl. 42(13), 5424\u20135432 (2015)","journal-title":"Expert Syst. Appl."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Domingos, P., Hulten, G.: Mining high-speed data streams. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 71\u201380 (2000)","DOI":"10.1145\/347090.347107"},{"key":"8_CR5","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"F\u00fcrnkranz, J., Gamberger, D., Lavra\u010d, N.: Foundations of Rule Learning. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-75197-7","DOI":"10.1007\/978-3-540-75197-7"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Huynh, V.Q.P., Beck, F., F\u00fcrnkranz, J.: Efficient learning of large sets of locally optimal classification rules. Mach. Learn. (2023). accepted with minor revisions","DOI":"10.1007\/s10994-022-06290-w"},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112874","volume":"140","author":"VQP Huynh","year":"2020","unstructured":"Huynh, V.Q.P., K\u00fcng, J.: FPO tree and DP3 algorithm for distributed parallel frequent itemsets mining. Expert Syst. Appl. 140, 112874 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10994-009-5162-2","volume":"78","author":"F Janssen","year":"2010","unstructured":"Janssen, F., F\u00fcrnkranz, J.: On the quest for optimal rule learning heuristics. Mach. Learn. 78(3), 343\u2013379 (2010)","journal-title":"Mach. Learn."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/s10618-013-0340-z","volume":"29","author":"P Kosina","year":"2013","unstructured":"Kosina, P., Gama, J.: Very fast decision rules for classification in data streams. Data Min. Knowl. Disc. 29(1), 168\u2013202 (2013). https:\/\/doi.org\/10.1007\/s10618-013-0340-z","journal-title":"Data Min. Knowl. Disc."},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1009744630224","volume":"2","author":"SK Murthy","year":"1998","unstructured":"Murthy, S.K.: Automatic construction of decision trees from data: a multi-disciplinary survey. Data Min. Knowl. Disc. 2(4), 345\u2013389 (1998)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR12","unstructured":"Schlimmer, J.C., Fisher, D.H.: A case study of incremental concept induction. In: Kehler, T. (ed.) Proceedings of the 5th National Conference on Artificial Intelligence (AAAI), Volume 1: Science, Philadelphia, PA, USA, pp. 496\u2013501. Morgan Kaufmann (1986)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18840-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T06:09:50Z","timestamp":1678514990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18840-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031188398","9783031188404"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18840-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montpellier","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2022.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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"27","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":"12","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":"46% - 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":"2.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":"2.5","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)"}}]}}