Please use this identifier to cite or link to this item:
Title: Adaptive resonance associative map
Authors: Tan, A.-H. 
Keywords: Associative memory
Heteroassociative recall
Neural network architecture
Supervised learning
Issue Date: 1995
Citation: Tan, A.-H. (1995). Adaptive resonance associative map. Neural Networks 8 (3) : 437-446. ScholarBank@NUS Repository.
Abstract: This article introduces a neural architecture termed Adaptive Resonance Associative Map (ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class of supervised ART models known as ARTMAP, it produces classification performance equivalent to that of ARTMAP. As ARAM network structure and operations are symmetrical, associative recall can be performed in both directions. With maximal vigilance settings, ARAM encodes pattern pairs explicitly as cognitive chunks and thus guarantees perfect storage and recall of an arbitrary number of arbitrary pattern pairs. Simulations on an iris plant and a sonar return recognition problems compare ARAM classification performance with that of counterpropagation network, K-nearest neighbor system, and back propagation network. Associative recall experiments on two pattern sets show that, besides the advantages of fast learning, guaranteed perfect storage, and full memory capacity, ARAM produces a stronger noise immunity than Bidirectional Associative Memory (BAM). © 1995.
Source Title: Neural Networks
ISSN: 08936080
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Feb 2, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.