Neural self-organization using graphs

Authors:
Arpad Barsi
Affiliations:
Department of Photogrammetry and Geoinformatics, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Year:
2003

Citing 6
Cited 0

A massively parallel architecture for a self-organizing neural pattern recognition machine

Computer Vision, Graphics, and Image Processing
Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition
Neural network models for pattern recognition and associative memory

Neural Networks
Self-organizing maps

Self-organizing maps
Pattern Recognition by Self-Organizing Neural Networks

Pattern Recognition by Self-Organizing Neural Networks
Graph Theory in Modern Engineering: Computer Aided Design, Optimization, Reliability Analysis

Graph Theory in Modern Engineering: Computer Aided Design, Optimization, Reliability Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The self-organizing feature map (SOFM) algorithm can be generalized, if the regular neuron grid is replaced by an undirected graph. The training rule is furthermore very simple: after a competition step, the weights of the winner neuron and its neighborhood must be updated. The update is based on the generalized adjacency of the initial graph. This feature is invariant during the training; therefore its derivation can be achieved in the preprocessing. The newly developed self-organizing neuron graph (SONG) algorithm is applied in function approximation, character fitting and satellite image analysis. The results have proven the efficiency of the algorithm.