Skip to Main content Skip to Navigation
Conference papers

Accelerating stochastic kernel SOM

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Nathalie Vialaneix <>
Submitted on : Tuesday, May 2, 2017 - 9:21:15 AM
Last modification on : Thursday, July 16, 2020 - 3:06:02 PM
Long-term archiving on: : Thursday, August 3, 2017 - 12:29:58 PM


Files produced by the author(s)


  • HAL Id : hal-01516660, version 1



Jérôme 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⟩



Record views


Files downloads