GAIPS
Publications

Regarding the temporal requirements of a hierarchical Willshaw network [PDF]


Abstract_ In a recent communication, Sacramento & Wichert (2011) proposed a hierarchical retrieval prescription for Willshaw-type associative networks. Through simulation it was shown that one could make use of low resolution descriptor patterns to decrease the total time requirements of recalling a learnt association. However, such method introduced a dependence on a set of new parameters which de ne the structure of the hierarchy. In this work we compute the expected retrieval time for the random neural activity regime which maximises the capacity of the Willshaw model and we study the task of finding the optimal hierarchy parametrisation with respect to the derived temporal expectation. Still in regard to this performance measure, we investigate some asymptotic properties of the algorithm.
Year_ 2012
Authors_ João Sacramento, Francisco Burnay, Andreas Wichert
Journal_ Neural Networks
Volume_ 25
Pages_ 84-93
Month_ January

Bibtex_