CLAM: A new model of associative memory
International Journal of Intelligent Systems, 2000•Wiley Online Library
We present a new associative memory model that stores arbitrary bipolar patterns without
the problems we can find in other models like BAM or LAM. After identifying those problems
we show the new memory topology and we explain its learning and recall stages.
Mathematical demonstrations are provided to prove that the new memory model guarantees
the perfect retrieval of every stored pattern and also to prove that whatever the input of the
memory is, it operates as a nearest neighbor classifier.© 2000 John Wiley & Sons, Inc.
the problems we can find in other models like BAM or LAM. After identifying those problems
we show the new memory topology and we explain its learning and recall stages.
Mathematical demonstrations are provided to prove that the new memory model guarantees
the perfect retrieval of every stored pattern and also to prove that whatever the input of the
memory is, it operates as a nearest neighbor classifier.© 2000 John Wiley & Sons, Inc.
Abstract
We present a new associative memory model that stores arbitrary bipolar patterns without the problems we can find in other models like BAM or LAM. After identifying those problems we show the new memory topology and we explain its learning and recall stages. Mathematical demonstrations are provided to prove that the new memory model guarantees the perfect retrieval of every stored pattern and also to prove that whatever the input of the memory is, it operates as a nearest neighbor classifier. ©2000 John Wiley & Sons, Inc.
Wiley Online Library以上显示的是最相近的搜索结果。 查看全部搜索结果