Analogical Dissimilarity: Definition, Algorithms and Two Experiments in Machine Learning
This paper defines the notion of analogical dissimilarity between four objects, with a special focus on objects structured as sequences. Firstly, it studies the case where the four objects have a null analogical dissimilarity, i.e. are in analogical proportion. Secondly, when one of these objects is unknown, it gives algorithms to compute it. Thirdly, it tackles the problem of defining analogical dissimilarity, which is a measure of how far four objects are from being in analogical proportion. In particular, when objects are sequences, it gives a definition and an algorithm based on an optimal alignment of the four sequences. It gives also learning algorithms, i.e. methods to find the triple of objects in a learning sample which has the least analogical dissimilarity with a given object. Two practical experiments are described: the first is a classification problem on benchmarks of binary and nominal data, the second shows how the generation of sequences by solving analogical equations enables a handwritten character recognition system to rapidly be adapted to a new writer.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
Frank's triangular norms in Piaget's logical proportions
Starting from the Boolean notion of logical proportion in Piaget's sense, which turns out to be equivalent to analogical proportion, this note proposes a definition of analogical proportion between numerical values based…
Analogy-Based Preference Learning with Kernels
Building on a specific formalization of analogical relationships of the form "A relates to B as C relates to D", we establish a connection between two important subfields of artificial intelligence, namely analogical rea…
From numerical proportions to analogical proportions between probabilities
Analogical proportions link four items a, b, c, d by a relation stating that ``a is to b as c is to d", a, b, c, d being the formal representation of real world entities, ranging from simple numerical values to more comp…
Measuring dissimilarity with diffeomorphism invariance
Measures of similarity (or dissimilarity) are a key ingredient to many machine learning algorithms. We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces, which leverages the data's…
Further results on dissimilarity spaces for hyperspectral images RF-CBIR
Content-Based Image Retrieval (CBIR) systems are powerful search tools in image databases that have been little applied to hyperspectral images. Relevance feedback (RF) is an iterative process that uses machine learning …
BIG-bench Machine LearningContent-Based Image RetrievalImage RetrievalRetrieval