{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:25:59Z","timestamp":1759177559968},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"abstract":"<jats:p>Recently, several exact methods to compute decision trees have been introduced. On the one hand, these approaches can find optimal trees for various objective functions including total size, depth or accuracy on the training set and therefore.  On the other hand, these methods are not yet widely used in practice and classic heuristics are often still the methods of choice.\n\n\n\nIn this paper we show how the SAT model proposed by [Narodytska et.al 2018] can be lifted to a MaxSAT approach, making it much more practically relevant. \n\nIn particular, it scales to much larger data sets; the objective function can easily be adapted to take into account combinations of size, depth and accuracy on the training set; and the fine-grained control of the objective function it offers makes it particularly well suited for boosting.\n\n\n\nOur experiments show promising results.\n\nIn particular, we show that the prediction quality of  our approach often exceeds state of the art heuristics.  We also show that the MaxSAT formulation is well adapted for boosting using the well-known AdaBoost Algorithm.<\/jats:p>","DOI":"10.24963\/ijcai.2020\/163","type":"proceedings-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T08:12:10Z","timestamp":1594195930000},"page":"1170-1176","source":"Crossref","is-referenced-by-count":15,"title":["Learning Optimal Decision Trees with MaxSAT and its Integration in AdaBoost"],"prefix":"10.24963","author":[{"given":"Hao","family":"Hu","sequence":"first","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, INSA, Toulouse, France"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, INSA, Toulouse, France"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, INSA, Toulouse, France"}]},{"given":"Marie-Jos\u00e9","family":"Huguet","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, INSA, Toulouse, France"}]}],"member":"10584","event":{"number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-PRICAI-2020","name":"Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}","start":{"date-parts":[[2020,7,11]]},"theme":"Artificial Intelligence","location":"Yokohama, Japan","end":{"date-parts":[[2020,7,17]]}},"container-title":["Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T22:13:40Z","timestamp":1594246420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2020\/163"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2020\/163","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}