Accélération des cartes auto-organisatrices sur tableau de dissimilarités par séparation et évaluation

Simple item page
dc.creatorConan-Guez, Brieuc
dc.creatorRossi, Fabrice
dc.date2008-02-02
dc.date.accessioned2026-07-07T09:18:27Z
dc.date.available2026-07-07T09:18:27Z
dc.descriptionIn 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.
dc.descriptionA paraître
dc.identifierhttps://arxiv.org/abs/0802.0252
dc.identifierhttp://arxiv.org/abs/0802.0252
dc.identifierREVUE DES NOUVELLES TECHNOLOGIES DE L'INFORMATION (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154032
dc.subjectNeural and Evolutionary Computing
dc.titleAccélération des cartes auto-organisatrices sur tableau de dissimilarités par séparation et évaluation
dc.typetext

Files

Collections

arXiv