{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T09:51:15Z","timestamp":1747216275976,"version":"3.40.5"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"type":"print","value":"9781643684369"},{"type":"electronic","value":"9781643684376"}],"license":[{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,28]]},"abstract":"<jats:p>We elaborate on the notion of rectification of a classifier \u03a3 based on Boolean features, introduced in [10]. The purpose is to determine how to modify \u03a3 when the way it classifies a given instance is considered incorrect since it conflicts with some expert knowledge T. Given \u03a3 and T, postulates characterizing the way \u03a3 must be changed into a new classifier \u03a3 \u22c6 T that complies with T were presented. We focus here on the specific case of binary classifiers, i.e., there is a single target concept, and any instance is classified either as positive (an element of the concept), or as negative (an element of the complementary concept). In this specific case, our main contribution is twofold: (1) we show that there is a unique rectification operator \u22c6 satisfying the postulates, and (2) when \u03a3 and T are Boolean circuits, we show how a classification circuit equivalent to \u03a3 \u22c6 T can be computed in time linear in the size of \u03a3 and T; when \u03a3 is a decision tree (resp. a random forest, a boosted tree) and T is a decision tree, a decision tree (resp. a random forest, a boosted tree) equivalent to \u03a3 \u22c6 T can be computed in time polynomial in the size of \u03a3 and T.<\/jats:p>","DOI":"10.3233\/faia230307","type":"book-chapter","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:03:31Z","timestamp":1695978211000},"source":"Crossref","is-referenced-by-count":0,"title":["Rectifying Binary Classifiers"],"prefix":"10.3233","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4742-4858","authenticated-orcid":false,"given":"Sylvie","family":"Coste-Marquis","sequence":"first","affiliation":[{"name":"Univ. Artois, CNRS, CRIL, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7979-6608","authenticated-orcid":false,"given":"Pierre","family":"Marquis","sequence":"additional","affiliation":[{"name":"Univ. Artois, CNRS, CRIL, France"},{"name":"Institut Universitaire de France, France"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2023"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA230307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:03:32Z","timestamp":1695978212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA230307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"ISBN":["9781643684369","9781643684376"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia230307","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"type":"print","value":"0922-6389"},{"type":"electronic","value":"1879-8314"}],"subject":[],"published":{"date-parts":[[2023,9,28]]}}}