Using a Library of Efficient Data Structures and Algorithms as a Neural Network Research Tool
暂无分享,去创建一个
Abstract In this contribution we emphasize the close relation between a general neural network and an abstract graph. Since graphs are a general data structure used in many different areas, many efficient algorithms for graph manipulation and inspection exist. These algorithms can often be used to implement neural network models very efficiently. Moreover abstract data types as sets and lists can support the development of algorithms considerably. Specifically we report here on LEDA, a publicly available C++ class library of data types and algorithms. As an example some details of the implementation of a new self-organizing network, the growing cell structures, are given.
[1] Stefan Näher,et al. LEDA: A Library of Efficient Data Types and Algorithms , 1989, STACS.
[2] Kurt Mehlhorn,et al. LEDA: A Library of Efficient Data Types and Algorithms , 1989, MFCS.
[3] T. Kohonen. Self-organized formation of topographically correct feature maps , 1982 .
[4] Bernd Fritzke. Growing Cell Structures – a Self-organizing Network in k Dimensions , 1992 .