How Many Dissimilarity/Kernel Self Organizing Map Variants Do We Need? - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

How Many Dissimilarity/Kernel Self Organizing Map Variants Do We Need?

Abstract

In numerous applicative contexts, data are too rich and too complex to be represented by numerical vectors. A general approach to extend machine learning and data mining techniques to such data is to really on a dissimilarity or on a kernel that measures how different or similar two objects are. This approach has been used to define several variants of the Self Organizing Map (SOM). This paper reviews those variants in using a common set of notations in order to outline differences and similarities between them. It discusses the advantages and drawbacks of the variants, as well as the actual relevance of the dissimilarity/kernel SOM for practical applications.
Fichier principal
Vignette du fichier
rossi2014-how-many.pdf (187.66 Ko) Télécharger le fichier
slides.pdf (2.99 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other
Loading...

Dates and versions

hal-01017468 , version 1 (02-07-2014)

Identifiers

Cite

Fabrice Rossi. How Many Dissimilarity/Kernel Self Organizing Map Variants Do We Need?. 10th International Workshop on Self Organizing Maps, WSSOM 2014, Jul 2014, Mittweida, Germany. pp.3-23, ⟨10.1007/978-3-319-07695-9_1⟩. ⟨hal-01017468⟩
135 View
350 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More