Name
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. |
Year | Venue | Field |
|---|---|---|
2017 | ESANN | Kernel (linear algebra),Drawback,Computer science,Euclidean space,Theoretical computer science,Artificial intelligence,Markov kernel,Machine learning,R package,Cube |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jérôme Mariette | 1 | 9 | 2.18 |
| Fabrice Rossi | 2 | 28 | 3.09 |
| Madalina Olteanu | 3 | 68 | 10.50 |
| Nathalie Villa-Vialaneix | 4 | 72 | 10.94 |