Skip to Main content Skip to Navigation
Conference papers

Behavior of Analogical Inference w.r.t. Boolean Functions

Miguel Couceiro 1 Nicolas Hug 2 Henri Prade 2, 3 Gilles Richard 2
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
2 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
IRIT - Institut de recherche en informatique de Toulouse
Abstract : It has been observed that a particular form of ana-logical inference, based on analogical proportions, yields competitive results in classification tasks. Using the algebraic normal form of Boolean functions , it has been shown that analogical prediction is always exact iff the labeling function is affine. We point out that affine functions are also meaningful when using another view of analogy. We address the accuracy of analogical inference for arbitrary Boolean functions and show that if a function is ε-close to an affine function, then the probability of making a wrong prediction is upper bounded by 4ε. This result is confirmed by an empirical study showing that the upper bound is tight. It highlights the specificity of analogical inference, also characterized in terms of the Hamming distance.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Miguel Couceiro Connect in order to contact the contributor
Submitted on : Saturday, May 25, 2019 - 4:31:41 PM
Last modification on : Tuesday, October 19, 2021 - 2:23:19 PM


Files produced by the author(s)


  • HAL Id : hal-02139765, version 1


Miguel Couceiro, Nicolas Hug, Henri Prade, Gilles Richard. Behavior of Analogical Inference w.r.t. Boolean Functions. IJCAI 2018 - 27th International Joint Conference on Artificial Intelligence, Jul 2018, Stockholm, Sweden. pp.2057--2063. ⟨hal-02139765⟩



Record views


Files downloads