login

Similarity, Connectionism, and the Problem of Representation in Vision

Neural ComputationPublished 1 May 1997
Shimon Edelman, Sharon Duvdevani-Bar
Citations40
SJR quartileQ1
SJR score0.83
SNIP1.45

TL;DR

The computational requirements of representation that preserves similarity ranks are discussed and the relative straightforwardness of its connectionist implementation is pointed out.

Abstract

A representational scheme under which the ranking between represented similarities is isomorphic to the ranking between the corresponding shape similarities can support perfectly correct shape classification because it preserves the clustering of shapes according to the natural kinds prevailing in the external world. This article discusses the computational requirements of representation that preserves similarity ranks and points out the relative straightforwardness of its connectionist implementation.

Keywords

PsychologyComputer ScienceNeuroscience