2000 character limit reached
Accélération des cartes auto-organisatrices sur tableau de dissimilarités par séparation et évaluation (0802.0252v1)
Published 2 Feb 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.