Accelerating stochastic kernel SOM - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Accelerating stochastic kernel SOM


Analyzing non vectorial data has become a common trend in a number of real-life applications. Various prototype-based methods have been extended to answer this need by means of kernalization that embed data into an (implicit) Euclidean space. One drawback of those approaches is their complexity, which is commonly of order the square or the cube of the number of observations. In this paper, we propose an efficient method to reduce complexity of the stochastic kernel SOM. The results are illustrated on large datasets and compared to the standard kernel SOM. The approach has been implemented in the last version of the R package SOMbrero.
Fichier principal
Vignette du fichier
mariette_etal_ESANN2017.pdf (111.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01516660 , version 1 (02-05-2017)


  • HAL Id : hal-01516660 , version 1


Jérôme J. Mariette, Fabrice Rossi, Madalina Olteanu, Nathalie Vialaneix. Accelerating stochastic kernel SOM. XXVth European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, Apr 2017, Bruges, Belgium. pp.269-274. ⟨hal-01516660⟩
97 View
66 Download


Gmail Facebook Twitter LinkedIn More