Tumble tree: reducing complexity of the growing cells approach

  • Authors:
  • Hendrik Annuth;Christian A. Bohn

  • Affiliations:
  • Wedel University of Applied Sciences, Wedel, FR, Germany;Wedel University of Applied Sciences, Wedel, FR, Germany

  • Venue:
  • ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part III
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on a novel way of ordering the cells in a tree like data structure in a way that random access during training is replaced by tree traversals. Overall time complexity is reduced from O(n2) to O(n log n) which opens new application fields to the growing cells structures approach.