Dynamical Neural Network: Information and Topology

dc.creatorDominguez, David
dc.creatorKoroutchev, Kostadin
dc.creatorSerrano, Eduardo
dc.creatorRodriguez, Francisco B.
dc.date2005-06-20
dc.date.accessioned2026-07-07T03:23:09Z
dc.date.available2026-07-07T03:23:09Z
dc.descriptionA neural network works as an associative memory device if it has large storage capacity and the quality of the retrieval is good enough. The learning and attractor abilities of the network both can be measured by the mutual information (MI), between patterns and retrieval states. This paper deals with a search for an optimal topology, of a Hebb network, in the sense of the maximal MI. We use small-world topology. The connectivity $γ$ ranges from an extremely diluted to the fully connected network; the randomness $ω$ ranges from purely local to completely random neighbors. It is found that, while stability implies an optimal $MI(γ,ω)$ at $γ_{opt}(ω)\to 0$, for the dynamics, the optimal topology holds at certain $γ_{opt}>0$ whenever $0\leqω<0.3$.
dc.description10pg, 5fig
dc.identifierhttps://arxiv.org/abs/cs/0506078
dc.identifierhttp://arxiv.org/abs/cs/0506078
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32834
dc.subjectInformation Retrieval
dc.subjectNeural and Evolutionary Computing
dc.titleDynamical Neural Network: Information and Topology
dc.typetext

Files

Collections