Fractal initialization for high-quality mapping with self-organizing maps

  • Authors:
  • Iren Valova;Derek Beaton;Alexandre Buer;Daniel MacLean

  • Affiliations:
  • University of Massachusetts Dartmouth, Computer and Information Science, 285 Old Westport Rd, 02747, North Dartmouth, MA, USA;University of Massachusetts Dartmouth, Computer and Information Science, 285 Old Westport Rd, 02747, North Dartmouth, MA, USA;University of Massachusetts Dartmouth, Computer and Information Science, 285 Old Westport Rd, 02747, North Dartmouth, MA, USA;University of Massachusetts Dartmouth, Computer and Information Science, 285 Old Westport Rd, 02747, North Dartmouth, MA, USA

  • Venue:
  • Neural Computing and Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Initialization of self-organizing maps is typically based on random vectors within the given input space. The implicit problem with random initialization is the overlap (entanglement) of connections between neurons. In this paper, we present a new method of initialization based on a set of self-similar curves known as Hilbert curves. Hilbert curves can be scaled in network size for the number of neurons based on a simple recursive (fractal) technique, implicit in the properties of Hilbert curves. We have shown that when using Hilbert curve vector (HCV) initialization in both classical SOM algorithm and in a parallel-growing algorithm (ParaSOM), the neural network reaches better coverage and faster organization.