{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:32:00Z","timestamp":1764570720949},"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":[[2017,8]]},"abstract":"<jats:p>Training set extension is an important issue in machine learning.  Indeed when the examples at hand are in a limited quantity, the performances of standard  classifiers  may  significantly  decrease  and  it can be helpful to build additional examples. In this paper,  we  consider  the  use  of  analogical  reasoning, and more particularly of analogical proportions for extending training sets.  Here the ground truth labels  are  considered  to  be  given  by  a  (partially known) function.  We examine the conditions that are required for such functions to ensure an error-free extension in a Boolean setting. To this end, we introduce  the  notion  of  Analogy  Preserving  (AP) functions, and we prove that their class is the class of  affine  Boolean  functions.   This  noteworthy  theoretical result is complemented with an empirical investigation of approximate AP functions, which suggests that they remain suitable for training set extension.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/218","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T05:14:07Z","timestamp":1501218847000},"page":"1575-1581","source":"Crossref","is-referenced-by-count":18,"title":["Analogy-preserving functions: A way to extend Boolean samples"],"prefix":"10.24963","author":[{"given":"Miguel","family":"Couceiro","sequence":"first","affiliation":[{"name":"LORIA - University of Lorraine"}]},{"given":"Nicolas","family":"Hug","sequence":"additional","affiliation":[{"name":"IRIT - University of Toulouse III"}]},{"given":"Henri","family":"Prade","sequence":"additional","affiliation":[{"name":"IRIT - University of Toulouse III"},{"name":"QCIS - University of Technology, Sydney"}]},{"given":"Gilles","family":"Richard","sequence":"additional","affiliation":[{"name":"IRIT - University of Toulouse III"},{"name":"BITE, London"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T07:52:50Z","timestamp":1501228370000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/218"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/218","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}