Spurious minima and basins of attraction in higher-order Hopfield networks

Authors:
M. Atencia;G. Joya;F. Sandoval
Affiliations:
Departamento de Matemática Aplicada, E.T.S.I. Informática, Universidad de Málaga, Málaga, Spain;Departamento de Tecnología Electrónica. E.T.S.I. Telecomunicación, Universidad de Málaga, Málaga, Spain;Departamento de Tecnología Electrónica. E.T.S.I. Telecomunicación, Universidad de Málaga, Málaga, Spain
Venue:
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Year:
2003

Citing 6
Cited 1

Parallel algorithms for the single source shortest path problem

Computing
A parallel shortest path algorithm

Computing
Optimal path determination in a graph by Hopfield neural network

Neural Networks
An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

Neural Processing Letters
A Parallel Priority Data Structure with Applications

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Recurrent Multivalued Neural Network for the N-Queens Problem

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I

Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new neural network model that generalizes Hopfield model is proposed. It allows to implement an algorithm similar to the Dijkstra's one in order to solve the shortest path problem on a weighted graph. With this neural and parallel implementation, the presented model is adapted to possible modifications in the graph. Moreover, it is possible to solve other related problems with the same structure.