Article View: comp.archives
Article #5130[neural-nets] Basins of Attraction vs Error-Detection
From: Arun Jagota
Date: Sun, 26 May 1991 19:13
Date: Sun, 26 May 1991 19:13
62 lines
3694 bytes
3694 bytes
Archive-name: ai/neural-nets/jagota/1991-05-25
Archive-directory: ftp.cs.buffalo.edu:/users/jagota/ [128.205.32.3]
Original-posting-by: jagota@sybil.cs.Buffalo.EDU (Arun Jagota)
Original-subject: Basins of Attraction vs Error-Detection
Reposted-by: emv@msen.com (Edward Vielmetti, MSEN)
For associative memories, sizes of basins of attractions has been
an object of theoretical study, motivated by the fact that large
basins are ``better'', for error-correction abiility. While not disputing
this, I offer one (error-detection) application for which basin attraction
sizes is not an issue, whereas the ``stability'' of the stored patterns is.
In one experiment, we ``stably'' stored ~240,000 English words in a
~580 unit fully connected Hopfield-type Network. The test set to the
network was a collection of random non-word strings. The task was to
identify the strings as errors. The network identified between 80-90%
of the test set strings as errors, taking ONE network cycle per string.
A plausible application of this idea is to take a large document containing
words from a LARGE dictionary, and ``garbage'' strings (far from any
dictionary word) and rapidly remove (many of the) latter.
shar file of LateX sources of the paper describing the details is available
via ftp as folows.
ftp ftp.cs.buffalo.edu
-- if this doesn't work try the following number, which will change
-- in a few weeks. Or send me e-mail.
ftp 128.205.32.3
Name : anonymous
> cd users/jagota
> get ijcnn_Jul91b.shar
> quit
There are several related papers in the same directory, accessible
by ftp as above. Get the file `README' for details. The simulator
is also available there. Get the file `hsn.README' for details.
Finally, as a last resort, but please, only if all else fails, or
if you do not have access to ftp, send me e-mail (jagota@cs.buffalo.edu)
and I can send you the same files (papers or simulator) by e-mail.
--
------------------------------------------------------------------------
Arun Jagota Internet: jagota@cs.buffalo.edu
Computer Science Department BITNET : jagota%cs.buffalo.edu@ubvm.bitnet
State Univesity of New York at Buffalo
-- comp.archives file verification
ftp.cs.buffalo.edu
total 773
-r--r--r-- 1 624 33517 May 25 12:25 ijcnn_Jun90.shar
-r--r--r-- 1 624 35523 May 25 12:24 ijcnn_Jan90.shar
-r--r--r-- 1 624 110465 May 25 12:21 wordrec.shar
-r--r--r-- 1 624 42420 May 25 12:10 ijcnn_Jul91a.shar
-r--r--r-- 1 624 34384 May 25 12:08 ijcnn_Jul91b.shar
-r--r--r-- 1 624 1927 May 24 15:11 README
-r--r--r-- 1 624 65895 May 24 14:35 dimacs_91.tex
-r--r--r-- 1 624 104637 May 16 20:36 tr90-25.shar
-r--r--r-- 1 624 3558 Apr 29 16:03 hsn.README
-r--r--r-- 1 624 122880 Apr 29 16:01 hsn.tar
-r--r--r-- 1 624 155114 Apr 29 11:59 tr90-02.shar
-r--r--r-- 1 624 37937 Apr 29 11:54 purdue_Apr90.shar
found jagota ok
ftp.cs.buffalo.edu:/users/jagota/
Technical Details
Message-ID:
<1991May26.191329.20138@ox.com>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!crdgw1!uakari.primate.wisc.edu!caen!ox.com!msen.com!emvShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!crdgw1!uakari.primate.wisc.edu!caen!ox.com!msen.com!emv From: jagota@sybil.cs.Buffalo.EDU (Arun Jagota) Newsgroups: comp.archives Subject: [neural-nets] Basins of Attraction vs Error-Detection Message-ID: <1991May26.191329.20138@ox.com> Date: 26 May 91 19:13:29 GMT Sender: emv@msen.com (Edward Vielmetti, MSEN) Reply-To: jagota@sybil.cs.Buffalo.EDU (Arun Jagota) Followup-To: comp.ai.neural-nets Organization: State University of New York at Buffalo/Comp Sci Lines: 62 Approved: emv@msen.com (Edward Vielmetti, MSEN) X-Original-Newsgroups: comp.ai.neural-nets