Generalized Connectionist Associative Memory
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Machine Learning. Pages 833-838.
Abstract
This paper presents a generalized associative memory model, which stores a collection of tuples whose components are sets rather than scalars. It is shown that all library patterns are stored stably. On the other hand spurious memories may develop. Applications of this model to storage and retrieval of naturallyarising generalized sequences in bioinformatics are presented. The model is shown to work well for detection of novel generalized sequences against a large database of stored sequences, and for removal of noisy black pixels in a probe image against a very large set of stored images.
@inproceedings{ijcai1999p119,
title = {Generalized Connectionist Associative Memory},
author = {Duffy, Nigel P. and Jagota, Arun K.},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {833--838},
year = {1999},
note = {Machine Learning},
url = {https://ijcai.org/proceedings/1999/119},
}
TY - CPAPER TI - Generalized Connectionist Associative Memory AU - Duffy, Nigel P. AU - Jagota, Arun K. T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 833 EP - 838 UR - https://ijcai.org/proceedings/1999/119 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: