Analogical Mapping Using Similarity of Binary Distributed Representations

  • Slipchenko S
  • Rachkovskij D
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.

Abstract

We develop an approach to analogical reasoning with hierarchically structured descriptions of episodes and situations based on a particular form of vector representations – structure-sensitive sparse binary distributed representations known as code-vectors. We propose distributed representations of analog elements that allow finding correspondence between the elements for implementing analogical mapping, as well as analogical inference, based on similarity of those representations. The proposed methods are investigated using test analogs and the obtained results are as those of known mature analogy models. However, exploiting similarity properties of distributed representations provides a better scaling, enhances the semantic basis of analogs and their elements as well as neurobiological plausibility. The paper also provides a brief survey of analogical reasoning, its models, and representations employed in those models.

Cite

CITATION STYLE

APA

Slipchenko, S. V., & Rachkovskij, D. A. (2009). Analogical Mapping Using Similarity of Binary Distributed Representations. International Journal “Information Theories & Applications,” 16(3), 269–289.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free