Fast BMU search in SOMs using random hyperplane trees
One of the most prominent Neural Networks (NNs) reported in the literature is the Kohonen’s Self-Organizing Map (SOM). In spite of all its desirable capabilities and the scores of reported applications, it, unfortunately, possesses some fundamental drawbacks. Two of these handicaps are the quality of the map learned and the time required to train it. The most demanding phase of the algorithm involves determining the so-called Best Matching Unit (BMU)1, which requires time that is proportional to the number of neurons in the NN. The focus of this paper is to reduce the time needed for this tedious task, and to attempt to obtain an approximation of the BMU is as little as logarithmic time. To achieve this, we depend heavily on the work of [3, 6], where the authors focused on how to accurately learn the data distribution connecting the neurons on a self-organizing tree, and how the learning algorithm, called the Tree-based Topology-Oriented SOM (TTOSOM), can be useful for data clustering [3, 6] and classification . We briefly state how we intend to reduce the training time for identifying the BMU efficiently. First, we show how a novel hyperplane-based partitioning scheme can be used to accelerate the task. Unlike the existing hyperplane-based partitioning methods reported in the literature, our algorithm can avoid ill-conditioned scenarios. It is also capable of considering data points that are dynamic. We demonstrate how these hyperplanes can be recursively defined, represented and computed, so as to recursively divide the hyper-space into two halves. As far as we know, the use of random hyperplanes to identify the BMU is both pioneering and novel.
|Título según SCOPUS:||Fast BMU search in SOMs using random hyperplane trees|
|Título de la Revista:||COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT IX|
|Editorial:||SPRINGER INTERNATIONAL PUBLISHING AG|
|Fecha de publicación:||2014|
|Página de inicio:||39|