The self-organizing map (SOM) and neural gas (NG) constitute popular algorithms to represent data by means of prototypes arranged on a topographic map. Both methods rely on the Euclidean metric, hence clusters are isotropic. In this contribution, we extend prototype-based clustering algorithms such as NG and SOM towards a metric which is given by a full adaptive matrix such that ellipsoidal clusters are accounted for. We derive batch optimization learning rules for prototype and matrix adaptation based on a general cost function for NG and SOM and we show convergence of the algorithm. It can be seen that matrix learning implicitly performs minor local principal component analysis (PCA) and the local eigenvectors correspond to the main axes of the ellipsoidal clusters. We demonstrate the behavior in several examples. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Arnonkijpanich, B., Hammer, B., Hasenfuss, A., & Lursinsap, C. (2008). Matrix learning for topographic neural maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5163 LNCS, pp. 572–582). https://doi.org/10.1007/978-3-540-87536-9_59
Mendeley helps you to discover research relevant for your work.