TurSOM: a turing inspired self-organizing map

  • Authors:
  • Derek Beaton;Iren Valova;Dan MacLean

  • Affiliations:
  • James J. Kaput Center for Research and Innovation in Mathematics Education, University of Massachusetts Dartmouth, Fairhaven, MA;Department of Computer and Information Science, University of Massachusett Dartmouth, North Dartmouth, MA;Computer and Information Science Department, University of Massachusett Dartmouth, North Dartmouth, MA

  • Venue:
  • IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

TurSOM [1], short for Turing Self-Organizing Map, introduces new concepts, responsibilities and mechanisms to the traditional SOM algorithm. It draws its inspiration from Turing Unorganized Machines, competitive learning techniques, and SOM algorithms. Turing's unorganized machines (TUM) were one of the first computational concepts of modeling the cortex. Turing also described these machines as having self-organizing behaviors. The primary difference between Turing's self-organization description, and more traditional models we are familiar with (Grossberg, Kohonen), are that connections, rather than neurons, self-organize. TurSOM adheres to unsupervised, competitive learning techniques, wherein all neurons, and all connections between them are self-organizing and competing. As such, it presents a novel self-organizing neural network algorithm that eliminates the need for post-processing methods for cluster identification.