Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!gatech!mcnc!duke!romeo!hsg
From: hsg@romeo.cs.duke.edu (Henry Greenside)
Newsgroups: comp.ai.neural-nets
Subject: Hopfield Nets vs Nearest Neighbor look-up...
Keywords: Hopfield nets, nearest neighbors, comparison
Message-ID: <15636@duke.cs.duke.edu>
Date: 20 Sep 89 18:52:42 GMT
Sender: news@duke.cs.duke.edu
Lines: 15


Does anyone know of any references comparing the
performance of a Hopfield network for associative
memory with nearest-neighbor look up? What I am after
is whether typical basins of attractions for fixed
points defined by the Hopfield model are well
approximated by the regions of space closest to the
fixed points (Voronoy polyhedra).

If this is the case, no dynamics is necessary to do
associative memory: as soon as one knows which basin of
attraction you are in, you know the answer.


	Henry Greenside