On using adaptive Binary Search Trees to enhance self organizing maps

Astudillo, C.A.; Oommen B.J.

Keywords: maps, rotation, binary, search, distribution, intelligence, length, space, trees, constant, time, input, self, artificial, path, stochastic, (mathematics), organizing, Tree-based

Abstract

We present a strategy by which a Self-OrganizingMap (SOM) with an underlying Binary Search Tree (BST) structure can be adaptively re-structured using conditional rotations. These rotations on the nodes of the tree are local and are performed in constant time, guaranteeing a decrease in the Weighted Path Length (WPL) of the entire tree. As a result, the algorithm, referred to as the Tree-based Topology-Oriented SOM with Conditional Rotations (TTO-CONROT), converges in such a manner that the neurons are ultimately placed in the input space so as to represent its stochastic distribution, and additionally, the neighborhood properties of the neurons suit the best BST that represents the data. © Springer-Verlag Berlin Heidelberg 2009.

Más información

Título de la Revista: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT IX
Volumen: 5866
Editorial: SPRINGER INTERNATIONAL PUBLISHING AG
Fecha de publicación: 2009
Página de inicio: 199
Página final: 209
URL: http://www.scopus.com/inward/record.url?eid=2-s2.0-78650435524&partnerID=q2rCbXpz