Emergent Mind
Accélération des cartes auto-organisatrices sur tableau de dissimilarités par séparation et évaluation
(0802.0252)
Published Feb 2, 2008
in
cs.NE
Abstract
In this paper, a new implementation of the adaptation of Kohonen self-organising maps (SOM) to dissimilarity matrices is proposed. This implementation relies on the branch and bound principle to reduce the algorithm running time. An important property of this new approach is that the obtained algorithm produces exactly the same results as the standard algorithm.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.